  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.
