TY - JOUR
T1 - On the hardness of approximating minimum vertex cover
AU - Dinur, Irit
AU - Safra, Samuel
PY - 2005/7
Y1 - 2005/7
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=29844440416&partnerID=8YFLogxK
U2 - 10.4007/annals.2005.162.439
DO - 10.4007/annals.2005.162.439
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:29844440416
SN - 0003-486X
VL - 162
SP - 439
EP - 485
JO - Annals of Mathematics
JF - Annals of Mathematics
IS - 1
ER -