| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652637 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
Abstract
We study the approximability of computing a maximum size uniquely restricted matching in a given bipartite graph. We prove that it is hard to approximate within a factor of , for any ϵ>0, unless NP=ZPP, and it is APX-complete when restricted to bipartite graphs of degree at most 3. We show that it can be approximated within a factor of 2 when restricted to 3-regular bipartite graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
