On the hardness of approximating minimum vertex cover

Irit Dinur*, Samuel Safra

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)439-485
Number of pages47
JournalAnnals of Mathematics
Issue number1
StatePublished - Jul 2005


Dive into the research topics of 'On the hardness of approximating minimum vertex cover'. Together they form a unique fingerprint.

Cite this