Algorithms for measuring perturbability in matroid optimization

Combinatorica

Volumn 18, Issue 4, 1998, Pages 503-518

  Frederickson, Greg N ^a   Solis Oba, Roberto ^b  

^a Purdue University   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039504486     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050036     Document Type: Article

References (29)

1. R. K. AHUJA, J. B. ORLIN, C. STEIN, and R. E. TARJAN: Improved algorithms for bipartite network flow, SIAM Journal on Computing, 23 (1994), 906-933.
2. O. BERMAN, D. I. INGCO, and A. R. ODONI: Improving the location of minisum facilities through network modification, Annals of Operations Research, 40 (1992), 1-16.
3. W. H. CUNNINGHAM: Testing membership in matroid polyhedra, Journal of Combinatorial Theory, Series B, 36 (1984), 61-188.
4. W. H. CUNNINGHAM: Minimum cuts, modular functions and matroid polyhedra, Networks, 15 (1985), 205-215.
5. W. H. CUNNINGHAM: Optimal attack and reinforcement of a network, Journal of the ACM, 32 (1985), 549-561.
6. K. U. DRANGMEISTER, S. O. KRUMKE, M. V. MARATHE, H. NOLTEMEIER, and S. S. RAVI: Modifying edges of a network to obtain short subgraphs, Theoretical Computer Science, 203 (1998), 91-121.
7. J. EDMONDS: Submodular functions, matroids, and certain polyhedra, in Combinatorial Structures, (R. K. Guy et al. eds.), Gordon and Beach, New York 1970, pp. 69-87.
8. G. N. FREDERICKSON and R. SOLIS-OBA: Increasing the weight of minimum spanning trees, Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, 539-546.
9. G. N. FREDERICKSON and R. SOLIS-OBA: Efficient algorithms for robustness in matroid optimization, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, 659-668.
10. G. N. FREDERICKSON and R. SOLIS-OBA: Efficient algorithms for robustness in resource allocation and scheduling problems, manuscript, 1997.
11. S. FUJISHIGE: Submodular functions and optimization, Elsevier Science Publishers, Amsterdam, 1991.
12. D. R. FULKERSON and G. C. HARDING: Maximizing the minimum source-sink path subject to a budget constraint, Mathematical Programming, 13 (1977), 116-118.
13. H. N. GABOW and R. E. TARJAN: Efficient algorithms for a family of matroid intersection problems, Journal of Algorithms, 5 (1984), 80-131.
14. H. N. GABOW: Algorithms for graphic polymatroids and parametric s-sets, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, 88-97.
15. G. GALLO, M. D. GRIGORIADIS, and R. E. TARJAN: A fast parametric maximum flow algorithm and applications, SIAM Journal on Computing, 18 (1989), 30-55.
16. D. GUSFIELD, L. WANG, and P. STELLING: Graph traversals, genes and matroids: an efficient special case of the traveling salesman problem, Tech. Rep. No. CSE-96-3, University of California, Davis, 1996.
17. D. GUSFIELD: Sensitivity analysis for combinatorial optimization, Ph.D. thesis, University of California, Berkeley, 1980.
18. F. S. HILLIER: Introduction to operations research, McGraw Hill, New York, 1995.
19. E. L. LAWLER: Combinatorial optimization: networks and matroids, Holt, Rinehart and Winston, 1976.
20. J. LEE and J. RYAN: Matroid applications and algorithms, ORSA J. Computing, 4 (1992), 70-98.
21. M. LIBURA: Sensitivity analysis for minimum weight base of a matroid, Control and Cybernetics, 20 (1991), 7-24.
22. M. MANSOUR, S. BALEMI, and W. TROUL (EDITORS): Robustness of dynamic systems with parameter uncertainties, Birkhauser Verlag, 1992.
23. H. NARAYANAN: A rounding technique for the polymatroid membership problem. Linear Algebra and its Applications, 221 (1995), 41-57.
24. C. A. PHILLIPS: The network inhibition problem, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993, 776-785.
25. J. S. PYM: The linking of sets in graphs, J. London Math. Soc., 44 (1969), 542-550.
26. A. RECSKI: Matroid theory and its applications, Springer Verlag, Berlin, 1989.
27. D. SHIER: Arc tolerances in shortest path and network flow problems, Networks, 10 (1980), 277-291.
28. R. E. TARJAN: Sensitivity analysis of minimum spanning trees and shortest path trees, Information Processing Letters, 14 (1982), 30-33.
29. D. J. A. WELSH: Matroid Theory, Academic Press, London 1976.