A 2/3-approximation of the matroid matching problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 762 LNCS, Issue , 1993, Pages 185-190

  Fujito, Toshihiro ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

EXPONENTIAL COMPLEXITY; GENERAL GRAPH; MATCHING PROBLEMS; MATROID INTERSECTION;

APPROXIMATION ALGORITHMS;

EID: 77954696914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57568-5_248     Document Type: Conference Paper

References (10)

1. C. Greene. A multiple exchange property for bases. In Proc. Amer. Math. Soc. 39, pages 45-50, 1973.
2. H.N. Gabow and M. Stallman. An augmenting path algorithm for linear matroid parity. Combinatorica, 6:123-150, 1986.
3. P. Jensen and B. Korte. Complexity of matroid property algorithms. SIAM Journal on Computing, 11:184-190, 1982.
4. L. Lovász. Matroid matching and some applications. J. of Combinatorial Theory (B), 28:208-236, 1980.
5. L. Lovász. Selecting independent lines from a family of lines in a space. Acta Scientiarum Mathematicarum, 42:121-131, 1980.
6. L. Lovász. The matroid matching problem. In Algebraic Methods in Graph Theory, Vol. 2, pages 495-518. North-Holland, 1981.
7. L. Lovász and M.D. Plummer. Matching Theory, chapter 11, pages 413-415. North-Holland, 1986.
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.
9. A. Recski. Matroid Theory and its Applications, volume 6 of Algorithms and Combinatorics. Springer-Verlag, 1989.
10. D.R. Woodall. An exchange theorem for bases of matroids. J. Combinatorial Theory (B), 16:227-229, 1974.