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

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.