Elsevier

Discrete Applied Mathematics

Volume 164, Part 2, 19 February 2014, Pages 406-412
Discrete Applied Mathematics

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

https://doi.org/10.1016/j.dam.2012.10.019Get rights and content
Under an Elsevier user license
open archive

Abstract

We devise a polynomial time approximation scheme (PTAS) 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 outside Oracle-coNP.

Keywords

Matroid matching
Matroid parity
Strongly base orderable matroids
Local search
PTAS

Cited by (0)