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. © 2007 Elsevier Inc. All rights reserved.
CITATION STYLE
Khot, S., & Regev, O. (2008). Vertex cover might be hard to approximate to within 2 - ε. Journal of Computer and System Sciences, 74(3), 335–349. https://doi.org/10.1016/j.jcss.2007.06.019
Mendeley helps you to discover research relevant for your work.