Thumbnail - No thumbnail

A note on the hardness results for the labeled perfect matching problems in bipartite graphs

Monnot, Jérôme (2007), A note on the hardness results for the labeled perfect matching problems in bipartite graphs. https://basepub.dauphine.fr/handle/123456789/20749

Type
Document de travail / Working paper
External document link
https://hal.archives-ouvertes.fr/hal-00917833
Date
2007
Series title
Cahier du LAMSADE
Series number
256
Published in
Paris
Metadata
Show full item record
Author(s)
Monnot, Jérôme cc
Abstract (EN)
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters 96 (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.
Subjects / Keywords
labeled matching; bipartite graphs; Approximation and complexity; inapproximation bounds