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 条
12345