Advertisement

A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms

  • Bianca Spille
  • Robert Weismantel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2337)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. Berge, Two theorems in graph theory, Proceedings of the National Academy of Sciences (U.S.A.) 43, 842–844, 1957MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    W. H. Cunningham and J. F. Geelen, The optimal path-matching problem, Combinatorica 17, no. 3, 315–337, 1997MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 11, 449–467, 1965MathSciNetCrossRefGoogle Scholar
  4. 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
  5. 5.
    J. Edmonds, Matroid Intersection, Annals of Discrete Mathematics 4, 39–49, 1979MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    A. Frank and L. Szegö, A note on the path-matching formula, EGRES Technical Report No. 2001-03, 2001Google Scholar
  7. 7.
    E. L. Lawler, Matroid intersection algorithms, Mathematical Programming 9, 31–56, 1975MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York etc., 1976Google Scholar
  9. 9.
    B. Spille and R. Weismantel, A Combinatorial Algorithm for the Independent Path-Matching Problem, Manuscript, 2001Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Bianca Spille
    • 1
  • Robert Weismantel
    • 2
  1. 1.EPFL-DMALausanneSwitzerland
  2. 2.Institute for Mathematical OptimizationUniversity of MagdeburgMagdeburgGermany

Personalised recommendations