Skip to main content
SpringerLink
Log in
Book cover

International Conference on Integer Programming and Combinatorial Optimization

IPCO 2002: Integer Programming and Combinatorial Optimization pp 9–20Cite as

A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

Supported by the European DONET program TMR ERB FMRX-CT98-0202.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Two theorems in graph theory, Proceedings of the National Academy of Sciences (U.S.A.) 43, 842–844, 1957

    Article  MathSciNet  MATH  Google Scholar 

  2. W. H. Cunningham and J. F. Geelen, The optimal path-matching problem, Combinatorica 17, no. 3, 315–337, 1997

    Article  MathSciNet  MATH  Google Scholar 

  3. J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 11, 449–467, 1965

    Article  MathSciNet  Google Scholar 

  4. J. Edmonds, Matroid partition, Math. Decision Sciences, Proceedings 5th Summer Seminary Stanford 1967, Part 1 (Lectures of Applied Mathematics 11), 335–345, 1968

    Google Scholar 

  5. J. Edmonds, Matroid Intersection, Annals of Discrete Mathematics 4, 39–49, 1979

    Article  MathSciNet  MATH  Google Scholar 

  6. A. Frank and L. Szegö, A note on the path-matching formula, EGRES Technical Report No. 2001-03, 2001

    Google Scholar 

  7. E. L. Lawler, Matroid intersection algorithms, Mathematical Programming 9, 31–56, 1975

    Article  MathSciNet  MATH  Google Scholar 

  8. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York etc., 1976

    Google Scholar 

  9. B. Spille and R. Weismantel, A Combinatorial Algorithm for the Independent Path-Matching Problem, Manuscript, 2001

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EPFL-DMA, CH-1015, Lausanne, Switzerland

    Bianca Spille

  2. Institute for Mathematical Optimization, University of Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Robert Weismantel

Authors
  1. Bianca Spille
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Weismantel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Program in Applied and Computational Mathematics, University of Princeton, Fine Hall, Washington Road, Princeton, NJ, 08544-1000, USA

    William J. Cook

  2. Sloan School of Management, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA, 02139-4307, USA

    Andreas S. Schulz

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spille, B., Weismantel, R. (2002). A Generalization of Edmonds’ Matching and Matroid Intersection Algorithms. In: Cook, W.J., Schulz, A.S. (eds) Integer Programming and Combinatorial Optimization. IPCO 2002. Lecture Notes in Computer Science, vol 2337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47867-1_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-47867-1_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43676-8

  • Online ISBN: 978-3-540-47867-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation