Skip to main content
SpringerLink
Log in

A 2/3-approximation of the matroid matching problem

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

Included in the following conference series:

  • 216 Accesses

Abstract

The computational complexity of the matroid matching problem, which generalizes the matching problem in general graphs and the matroid intersection problem, remains unresolved. Under the general assumption it can be shown to be exponential complexity. In this paper an approximation algorithm is given which achieves at least 2/3 of the optima under the same assumption. The theorems behind analysis of the algorithm also shed some light on the structure of matroid matching.

This work was partially supported by NSF Grant CCR-9114545.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Greene. A multiple exchange property for bases. In Proc. Amer. Math. Soc. 39, pages 45–50, 1973.

    Google Scholar 

  2. H.N. Gabow and M. Stallman. An augmenting path algorithm for linear matroid parity. Combinatorica, 6:123–150, 1986.

    Google Scholar 

  3. P. Jensen and B. Korte. Complexity of matroid property algorithms. SIAM Journal on Computing, 11:184–190, 1982.

    Article  Google Scholar 

  4. L. Lovász. Matroid matching and some applications. J. of Combinatorial Theory (B), 28:208–236, 1980.

    Article  Google Scholar 

  5. L. Lovász. Selecting independent lines from a family of lines in a space. Acta Scientiarum Mathematicarum, 42:121–131, 1980.

    Google Scholar 

  6. L. Lovász. The matroid matching problem. In Algebraic Methods in Graph Theory, Vol. 2, pages 495–518. North-Holland, 1981.

    Google Scholar 

  7. L. Lovász and M.D. Plummer. Matching Theory, chapter 11, pages 413–415. North-Holland, 1986.

    Google Scholar 

  8. J.B. Orlin and J.H. Vande Vate. Solving the linear matroid parity problem as a sequence of matroid intersection problems. Mathematical Programming, 47:81–106, 1990.

    Article  Google Scholar 

  9. A. Recski. Matroid Theory and its Applications, volume 6 of Algorithms and Combinatorics. Springer-Verlag, 1989.

    Google Scholar 

  10. D.R. Woodall. An exchange theorem for bases of matroids. J. Combinatorial Theory (B), 16:227–229, 1974.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Pennsylvania State University, 16802, University Park, PA, USA

    Toshihiro Fujito

Authors
  1. Toshihiro Fujito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujito, T. (1993). A 2/3-approximation of the matroid matching problem. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_248

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_248

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation