| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652592 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
