A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids

Details A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids

2011-02-17

arxiv.org/abs/1102.3491v1

Computer Science

Data Structures and Algorithms

8 pages, 3 figures. To appear in LAGOS 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380075