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.

[1]  U. Faigle,et al.  Book reviews , 1991, ZOR Methods Model. Oper. Res..

[2]  J. Pym,et al.  The Linking of Sets in Graphs , 1969 .

[3]  Harold N. Gabow,et al.  Algorithms for graphic polymatroids and parametric s-Sets , 1995, SODA '95.

[4]  Roberto Solis-Oba,et al.  Efficient algorithms for robustness in matroid optimization , 1997, SODA '97.

[5]  Robert E. Tarjan,et al.  Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..

[6]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[7]  William H. Cunningham,et al.  Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.

[8]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[9]  Daniel Mier Gusfield.  Sensitivity analysis for combinatorial optimization , 1980 .

[10]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[11]  Jennifer Ryan,et al.  Matroid Applications and Algorithms , 1992, INFORMS J. Comput..

[12]  Cynthia A. Phillips,et al.  The network inhibition problem , 1993, STOC.

[13]  Robert E. Tarjan,et al.  Improved Algorithms for Bipartite Network Flow , 1994, SIAM J. Comput..

[14]  William H. Cunningham,et al.  Minimum cuts, modular functions, and matroid polyhedra , 1985, Networks.

[15]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[16]  Douglas R. Shier,et al.  Arc tolerances in shortest path and network flow problems , 1980, Networks.

[17]  Madhav V. Marathe,et al.  Modifying Edges of a Network to Obtain Short Subgraphs , 1998, Theor. Comput. Sci..

[18]  Delbert Ray Fulkerson,et al.  Maximizing the minimum source-sink path subject to a budget constraint , 1977, Math. Program..

[19]  Roberto Solis-Oba,et al.  Increasing the weight of minimum spanning trees , 1996, SODA '96.

[20]  H. Narayanan.  A rounding technique for the polymatroid membership problem , 1995 .

[21]  S. Balemi,et al.  Robustness of Dynamic Systems With Parameter Uncertainties , 1992 .