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 条
  • [41] Approximation algorithms and hardness results for labeled connectivity problems
    Hassin, Refael
    Monnot, Jerome
    Segev, Danny
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 480 - 491
  • [42] Approximation algorithms and hardness results for labeled connectivity problems
    Hassin, Refael
    Monnot, Jerome
    Segev, Danny
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (04) : 437 - 453
  • [43] Perfect matchings in regular bipartite graphs
    Katerinis, P
    Tsikopoulos, N
    GRAPHS AND COMBINATORICS, 1996, 12 (04) : 327 - 331
  • [44] Perfect Matchings of Regular Bipartite Graphs
    Lukot'ka, Robert
    Rollova, Edita
    JOURNAL OF GRAPH THEORY, 2017, 85 (02) : 525 - 532
  • [45] The induced matching and chain subgraph cover problems for convex bipartite graphs
    Brandstaedt, Andreas
    Eschen, Elaine M.
    Sritharan, R.
    THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 260 - 265
  • [46] Matching graphs of hypercubes and complete bipartite graphs
    Fink, Jiri
    EUROPEAN JOURNAL OF COMBINATORICS, 2009, 30 (07) : 1624 - 1629
  • [47] The rotation graphs of perfect matchings of plane bipartite graphs
    Zhang, HP
    Zhang, FJ
    DISCRETE APPLIED MATHEMATICS, 1997, 73 (01) : 5 - 12
  • [48] Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems
    Boros, E
    Elbassioni, K
    Gurvich, V
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 122 - 133
  • [49] A Note on Matchings of Bipartite Graphs
    蔡小涛
    应用数学, 1991, (01) : 97 - 100
  • [50] Note on the choosability of bipartite graphs
    Wang, Guoping
    Huang, Qiongxiang
    ARS COMBINATORIA, 2010, 94 : 129 - 133
12345