Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
2009 (English)In: PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, 74-80 p.Conference paper (Refereed)
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  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 . Additionally, our result does not rely on the construction of a query efficient PCP as in .
Place, publisher, year, edition, pages
2009. 74-80 p.
, Annual IEEE Conference on Computational Complexity, ISSN 1093-0159
APPROXIMATE, ALGORITHMS, CLIQUE, MIGHT, HARD; CUT
IdentifiersURN: urn:nbn:se:kth:diva-30377DOI: 10.1109/CCC.2009.38ISI: 000273015300009ScopusID: 2-s2.0-70350626961ISBN: 978-0-7695-3717-7OAI: oai:DiVA.org:kth-30377DiVA: diva2:401304
24th Annual IEEE Conference on Computational Complexity, Paris, FRANCE, JUL 15-18, 2009
QC 201103022011-03-022011-02-242011-03-02Bibliographically approved