Article contents
A note on the hardness results for the labeledperfect matching problems in bipartite graphs
Published online by Cambridge University Press: 20 August 2008
Abstract
In this note, we strengthen the inapproximation bound of O(logn) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters96 (2005) 81–88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based on this approach we deduce that the problem does not admit constant approximation algorithms for connected planar cubic bipartite graphs.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, ROADEF, SMAI, 2008
References
- 2
- Cited by