A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids
Data Structures and Algorithms
2011-02-18 v1
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.
Cite
@article{arxiv.1102.3491,
title = {A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids},
author = {José A. Soto},
journal= {arXiv preprint arXiv:1102.3491},
year = {2011}
}
Comments
8 pages, 3 figures. To appear in LAGOS 2011