A simple PTAS for weighted matroid matching on strongly base orderable matroids

Electronic Notes in Discrete Mathematics

Volumn 37, Issue C, 2011, Pages 75-80

  Soto, José A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Local search; Matching; Matroid; Strongly base orderable

Indexed keywords

EID: 80053090085     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2011.05.014     Document Type: Article

References (5)

1. Jensen P.M., Korte B. Complexity of matroid property algorithms. SIAM J. Comput. 1982, 11:184-190.
2. J. Lee, M. Sviridenko, J. Vondrák, Matroid matching: The power of local search, Proc. of the 42nd ACM STOC, 2010, 369-378.
3. Lovász L. Matroid matching problems, in: Algebraic Methods in Graph Theory. Coll. Math. Soc. J. Bolyai 1981, 25:495-517. North-Holland.
4. A. Schrijver, Combinatorial Optimization - Polyhedra and Efficiency, 2003.
5. P. Tong, E. Lawler, V. Vazirani, Solving the weighted parity problem for gammoids by reduction to graphic matching, Progress in combinatorial optimization (Waterloo, Ont.), 1982, 363-374.