Algorithms for Measuring Perturbability in Matroid Optimization

perturbability function

of a matroid measures the maximum increase in the weight of its minimum weight bases that can be produced by increases of a given total cost on the weights of its elements. We present an algorithm for computing this function that runs in strongly polynomial time for matroids in which independence can be tested in strongly polynomial time. Furthermore, for the case of transversal matroids we are able to take advantage of their special structure to design a faster algorithm for computing the perturbability function.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: June 13, 1997

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Frederickson, G., Solis-Oba, R. Algorithms for Measuring Perturbability in Matroid Optimization. Combinatorica 18, 503–518 (1998). https://doi.org/10.1007/s004930050036

Download citation

  • AMS Subject Classification (1991) Classes:  05B35, 0504, 68R05