A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids
Jos\'e A. Soto
TL;DR
This paper presents a polynomial-time approximation scheme for the weighted matroid matching problem on strongly base orderable matroids, highlighting its computational complexity and providing an efficient solution for a specific class of matroids.
Contribution
Introduces a simple PTAS for weighted matroid matching on strongly base orderable matroids, and proves NP-completeness of the unweighted version.
Findings
PTAS for weighted matroid matching on strongly base orderable matroids
NP-completeness of the unweighted problem
The problem is not in oracle-coNP
Abstract
We give a simple polynomial time approximation scheme for the weighted matroid matching problem on strongly base orderable matroids. We also show that even the unweighted version of this problem is NP-complete and not in oracle-coNP.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Coding theory and cryptography