The Community for Technology Leaders
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. (2003)
Aarhus, Denmark
July 7, 2003 to July 10, 2003
ISSN: 1093-0159
ISBN: 0-7695-1879-6
pp: 379
Subhash Khot , Princeton University
Oded Regev , Institute for Advanced Study
ABSTRACT
Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [15], 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.
INDEX TERMS
null
CITATION

S. Khot and O. Regev, "Vertex Cover Might be Hard to Approximate to within 2-\varepsilon," 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.(CCC), Aarhus, Denmark, 2003, pp. 379.
doi:10.1109/CCC.2003.1214437
85 ms
(Ver 3.3 (11022016))