A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids

DOI10.1016/j.endm.2011.05.014zbMath1268.05044OpenAlexW2570966096MaRDI QIDQ2840687

Jose A. Soto

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/148084

zbMATH Keywords

matchinglocal searchmatroidstrongly base orderable

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25)

Related Items

Formal barriers to simple algorithms for the matroid secretary problem ⋮ Matroid-constrained vertex cover

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Matroid matching
• Complexity of Matroid Property Algorithms
• Unnamed Item
• Unnamed Item