Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

被引：30
|
作者：
Austrin, Per [1 ]
Khot, Subhash [2 ]
Safra, Muli [3 ]
机构：
[1] Royal Inst Technol, KTH, Stockholm, Sweden
[2] CUNY, New York, NY USA
[3] Tel Aviv Univ, IL-69978 Tel Aviv, Israel
来源：
PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY | 2009年
基金：
欧洲研究理事会; 美国国家科学基金会;
关键词：
APPROXIMATE; ALGORITHMS; MIGHT; CUT;
D O I：
10.1109/CCC.2009.38
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: Vertex Cover is Unique Games-hard to approximate to within a factor 2 - (2 + O-d (1)) log logd/log d. This exactly matches the algorithmic result of Halperin [1] up to the O-d(1) term. Independent Set is Unique Games-hard to approximate to within a factor O(d/log(2)d). This improves the d/log(O(1)) (d) Unique Games hardness result of Samorodnitsky and Trevisan [2]. Additionally, our result does not rely on the construction of a query efficient PCP as in [2].
引用
收藏
页码：74 / +
页数：3
相关论文
共 50 条
  • [41] Above guarantee parameterization for vertex cover on graphs with maximum degree 4
    Dekel Tsur
    [J]. Journal of Combinatorial Optimization, 2023, 45
  • [42] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    [J]. WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2020), 2020, 12049 : 286 - 295
  • [43] Approximability of the independent feedback vertex set problem for bipartite graphs
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 849 : 227 - 236
  • [44] Irreversible 2-conversion set in graphs of bounded degree
    Kyncl, Jan
    Lidicky, Bernard
    Vyskocil, Tomas
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2017, 19 (03):
  • [45] Parameterized edge dominating set in graphs with degree bounded by 3
    Xiao, Mingyu
    Nagamochi, Hiroshi
    [J]. THEORETICAL COMPUTER SCIENCE, 2013, 508 : 2 - 15
  • [46] Irreversible 2-conversion set in graphs of bounded degree
    [J]. 1600, Discrete Mathematics and Theoretical Computer Science (19):
  • [47] Approximation hardness of dominating set problems in bounded degree graphs
    Chlebik, M.
    Chlebikova, J.
    [J]. INFORMATION AND COMPUTATION, 2008, 206 (11) : 1264 - 1275
  • [48] Inapproximability of dominating set on power law graphs
    Gast, Mikael
    Hauptmann, Mathias
    Karpinski, Marek
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 562 : 436 - 452
  • [49] On approximability of the independent set problem for low degree graphs
    Chlebík, M
    Chlebíková, J
    [J]. STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDING, 2004, 3104 : 47 - 56
  • [50] BOUNDED VERTEX COLORINGS OF GRAPHS
    HANSEN, P
    HERTZ, A
    KUPLINSKY, J
    [J]. DISCRETE MATHEMATICS, 1993, 111 (1-3) : 305 - 312
12345