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

被引：1
|
作者：
Monnot, Jerome [1 ]
机构：
[1] Univ Paris 09, CNRS LAMSADE, F-75775 Paris 16, France
来源：
RAIRO-OPERATIONS RESEARCH | 2008年 / 42卷 / 03期
关键词：
labeled matching; bipartite graphs; approximation and complexity; inapproximation bounds;
D O I：
10.1051/ro:2008020
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：315 / 324
页数：10
相关论文
共 50 条
12345