Vertex cover might be hard to approximate to within 2 - ε

Research output: Contribution to journalArticle

Abstract

Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [S. Khot, On the power of unique 2-Prover 1-Round games, in: Proc. 34th ACM Symp. on Theory of Computing, STOC, May 2002, pp. 767-775], we show that vertex cover is hard to approximate within any constant factor better than 2. We actually show a stronger result, namely, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.

Original languageEnglish (US)
Pages (from-to)335-349
Number of pages15
JournalJournal of Computer and System Sciences
Volume74
Issue number3
DOIs
StatePublished - May 2008

Fingerprint

Vertex Cover
Game
Uniform Hypergraph
Computing

Keywords

  • Hardness of approximation
  • Unique games conjecture
  • Vertex cover

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Vertex cover might be hard to approximate to within 2 - ε. / Khot, Subhash; Regev, Oded.

In: Journal of Computer and System Sciences, Vol. 74, No. 3, 05.2008, p. 335-349.

Research output: Contribution to journalArticle

@article{9c41044eb33f4fc99243d6ca79ea005f,
title = "Vertex cover might be hard to approximate to within 2 - ε",
abstract = "Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [S. Khot, On the power of unique 2-Prover 1-Round games, in: Proc. 34th ACM Symp. on Theory of Computing, STOC, May 2002, pp. 767-775], we show that vertex cover is hard to approximate within any constant factor better than 2. We actually show a stronger result, namely, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.",
keywords = "Hardness of approximation, Unique games conjecture, Vertex cover",
author = "Subhash Khot and Oded Regev",
year = "2008",
month = "5",
doi = "10.1016/j.jcss.2007.06.019",
language = "English (US)",
volume = "74",
pages = "335--349",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Vertex cover might be hard to approximate to within 2 - ε

AU - Khot, Subhash

AU - Regev, Oded

PY - 2008/5

Y1 - 2008/5

N2 - Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [S. Khot, On the power of unique 2-Prover 1-Round games, in: Proc. 34th ACM Symp. on Theory of Computing, STOC, May 2002, pp. 767-775], we show that vertex cover is hard to approximate within any constant factor better than 2. We actually show a stronger result, namely, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.

AB - Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [S. Khot, On the power of unique 2-Prover 1-Round games, in: Proc. 34th ACM Symp. on Theory of Computing, STOC, May 2002, pp. 767-775], we show that vertex cover is hard to approximate within any constant factor better than 2. We actually show a stronger result, namely, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k.

KW - Hardness of approximation

KW - Unique games conjecture

KW - Vertex cover

UR - http://www.scopus.com/inward/record.url?scp=38149105774&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149105774&partnerID=8YFLogxK

U2 - 10.1016/j.jcss.2007.06.019

DO - 10.1016/j.jcss.2007.06.019

M3 - Article

AN - SCOPUS:38149105774

VL - 74

SP - 335

EP - 349

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 3

ER -