Dinur, Irit; Safra, Samuel On the hardness of approximating minimum vertex cover. (English) Zbl 1084.68051 Ann. Math. (2) 162, No. 1, 439-485 (2005). Summary: We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique. To that end, one needs to develop a new proof framework, and to borrow and extend ideas from several fields. Cited in 2 ReviewsCited in 172 Documents MSC: 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) PDFBibTeX XMLCite \textit{I. Dinur} and \textit{S. Safra}, Ann. Math. (2) 162, No. 1, 439--485 (2005; Zbl 1084.68051) Full Text: DOI Euclid