A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms
The independent path-matching problem is a common generalization of the matching problem and the matroid intersection problem. Cunningham and Geelen proved that this problem is solvable in polynomial time via the ellipsoid method. We present a polynomial-time combinatorial algorithm for its unweighted version that generalizes the known combinatorial algorithms for the cardinality matching problem and the matroid intersection problem.
Unable to display preview. Download preview PDF.
- 4.J. Edmonds, Matroid partition, Math. Decision Sciences, Proceedings 5th Summer Seminary Stanford 1967, Part 1 (Lectures of Applied Mathematics 11), 335–345, 1968Google Scholar
- 6.A. Frank and L. Szegö, A note on the path-matching formula, EGRES Technical Report No. 2001-03, 2001Google Scholar
- 8.E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York etc., 1976Google Scholar
- 9.B. Spille and R. Weismantel, A Combinatorial Algorithm for the Independent Path-Matching Problem, Manuscript, 2001Google Scholar