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 条
  • [31] A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs
    Asathulla, Mudabir Kabir
    Khanna, Sanjeev
    Lahn, Nathaniel
    Raghvendra, Sharath
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 457 - 476
  • [32] Spectral matching of bipartite graphs
    Srinivasan, SH
    DESIGN AND APPLICATION OF HYBRID INTELLIGENT SYSTEMS, 2003, 104 : 861 - 867
  • [33] Bipartite matching extendable graphs
    Wang, Xiumei
    Zhang, Zhenkun
    Lin, Yixun
    DISCRETE MATHEMATICS, 2008, 308 (23) : 5334 - 5341
  • [34] Bipartite Perfect Matching as a Real Polynomial
    Beniamini, Gal
    Nisan, Noam
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1118 - 1131
  • [35] BIPARTITE PERFECT MATCHING AS A REAL POLYNOMIAL
    Beniamini, Gal
    Nisan, Noam
    ISRAEL JOURNAL OF MATHEMATICS, 2023, 256 (01) : 91 - 131
  • [36] RECOGNITION OF PERFECT ELIMINATION BIPARTITE GRAPHS
    GOH, L
    ROTEM, D
    INFORMATION PROCESSING LETTERS, 1982, 15 (04) : 179 - 182
  • [37] Online Bipartite Perfect Matching With Augmentations
    Chaudhuri, Kamalika
    Daskalakis, Constantinos
    Kleinberg, Robert D.
    Lin, Henry
    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 1044 - +
  • [38] On the bipartite unique perfect matching problem
    Hoang, Thanh Minh
    Mahajan, Meena
    Thierauf, Thomas
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 453 - 464
  • [39] Bipartite unicyclic graphs with a unique perfect matching having the smallest positive eigenvalue equal to
    Barik, Sasmita
    Behera, Subhasish
    Kirkland, Steve
    LINEAR & MULTILINEAR ALGEBRA, 2024,
  • [40] Approximation algorithms and hardness results for labeled connectivity problems
    Refael Hassin
    Jérôme Monnot
    Danny Segev
    Journal of Combinatorial Optimization, 2007, 14 : 437 - 453
12345