Algebraic structures and algorithms for matching and matroid problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 531-540

  Harvey, Nicholas J A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC ALGORITHM; BIPARTITE MATCHING; MATROID INTERSECTION;

ALGORITHMS; COMBINATORIAL MATHEMATICS; PROBLEM SOLVING;

ALGEBRA;

EID: 38049029245     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.8     Document Type: Conference Paper

References (39)

1. A. I. Barvinok. New algorithms for linear k-matroid intersection and matroid k-parity problems. Mathematical Programming, 69:449-470, 1995.
2. P. Chalasani and R. Motwani. Approximating capacitated routing and delivery problems. SIAM Journal on Computing, 26(6):2133-2149, 1999.
3. J. Cheriyan. Randomized Õ(M(|V|)) algorithms for problems in matching theory. SIAM Journal on Computing, 26(6): 1635-1669, 1997.
4. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251280, 1990.
5. W. H. Cunningham. Improved bounds for matroid partition and intersection algorithms. SIAM Journal on Computing, 15(4):948-957, Nov. 1986.
6. W. H. Cunningham and J. F. Geelen. Vertex-disjoint directed paths and even circuits. Manuscript.
7. W. H. Cunningham and J. F. Geelen. The optimal path-matching problem. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 78-85, 1996.
8. W. H. Cunningham and J. F. Geelen. The optimal path-matching problem. Combinatorica, 17(3):315-337, 1997.
9. J. Edmonds. Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards, 69B:125-130, 1965.
10. J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
11. J. Edmonds. Submodular functions, matroids, and certain polyhedra. In R. Guy, H. Hanani, N. Sauer, and J. Schönheim, editors, Combinatorial Structures and Their Applications, pages 69-87.
12. Gordon and Breach, 1970. Republished in M. Jünger, G. Reinelt, G. Rinaldi, editors, Combinatorial Optimization - Eureka, You Shrink!, Lecture Notes in Computer Science 2570, pages 11-26. Springer-Verlag, 2003.
13. J. Edmonds. Matroid intersection. In P. L. Hammer, E. L. Johnson, and B. H. Korte, editors, Discrete Optimization I, volume 4 of Annals of Discrete Mathematics, pages 39-49. North-Holland, 1979.
14. S. Fujishige. Submodular Functions and Optimization, volume 58 of Annals of Discrete Mathematics. Elsevier, second edition, 2005.
15. H. N. Gabow and Y. Xu. Efficient theoretic and practical algorithms for linear matroid intersection problems. Journal of Computer and System Sciences, 53(1): 129-147, 1996.
16. F. R. Gantmakher. The Theory of Matrices, volume 1. Chelsea, New York, 1960. Translation by K.A. Kirsch.
17. J. F. Geelen. Matroids, Matchings, and Unimodular Matrices. PhD thesis, University of Waterloo, Canada, 1995.
18. J. F. Geelen. Matching theory. Lecture notes from the Euler Institute for Discrete Mathematics and its Applications, 2001.
19. C. D. Godsil. Algebraic Combinatorics. Chapman & Hall, 1993.
20. M. X. Goemans. Bounded degree minimum spanning trees. In Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
21. N. J. A. Harvey, D. R. Karger, and K. Murota. Deterministic network coding by matrix completion. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 05), pages 489-498, 2005.
22. M. Iri. Applications of matroid theory. In A. Bachem, M. Grötschel, and B. Korte, editors, Mathematical Programming: The State of the Art, pages 158-201. 1983.
23. E. L. Lawler. Matroid intersection algorithms. Mathematical Programming, 9:31-56, 1975.
24. L. Lovász. On determinants, matchings and random algorithms. In L. Budach, editor, Fundamentals of Computation Theory, FCT '79, pages 565-574. Akademie-Verlag, Berlin, 1979.
25. L. Lovász and M. D. Plummer. Matching Theory. Akadémiai Kiadó - North Holland, Budapest, 1986.
26. S. Micali and V. V. Vazirani. An O(√VE) algorithm for finding maximum matching in general graphs. In Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 17-27, 1980.
27. M. Mucha. Finding Maximum Matchings via Gaussian Elimination. PhD thesis, Warsaw University, 2005.
28. M. Mucha and P. Sankowski. Maximum matchings via Gaussian elimination. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 248-255, 2004.
29. K. Murota. Matrices and Matroids for Systems Analysis. Springer-Verlag, 2000.
30. H. Narayanan, H. Saran, and V. V. Vazirani. Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees. SIAM Journal on Computing, 23(2):387-397, 1994.
31. M. O. Rabin and V. V. Vazirani. Maximum matchings in general graphs through randomization. Journal of Algorithms, 10(4):557-567, 1989.
32. P. Sankowski. Dynamic transitive closure via dynamic matrix inverse. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 509-517, 2004.
33. P. Sankowski. Processor efficient parallel matching. In Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 165-170, 2005.
34. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, 2003.
35. A. Schrijver. On the history of combinatorial optimization (till 1960). In K. Aardal, G. L. Nemhauser, and R. Weismantel, editors, Discrete Optimization, volume 12 of Handbooks in Operations Research and Management Science, pages 1-68. North Holland, 2005.
36. G.Strang. Linear Algebra and its Applications. Thomson Learning, 1988.
37. N. Tomizawa and M. Iri. An Algorithm for Determining the Rank of a Triple Matrix Product AXB with Application to the Problem of Discerning the Existence of the Unique Solution in a Network. Electronics and Communications in Japan (Scripta Electronica Japonica II), 57(11):50-57, Nov. 1974.
38. W T. Tutte. The factorization of linear graphs. Journal of the London Mathematical Society, 22:107-111, 1947.
39. V. V. Vazirani. A theory of alternating paths and blossoms for proving correctness of the O (√VE) general graph matching algorithm. In Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference (IPCO), pages 509-530, 1990.