The importance of being biased

Irit Dinur, Shmuel Safra*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

We show that the Minimum Vertex Cover problem is NP-hard to approximate to within any factor smaller than 10√5-21 ≈ 1.36067, improving on the previously known hardness result for a 7/6 factor.

Original languageEnglish
Pages (from-to)33-42
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 2002
EventProceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada
Duration: 19 May 200221 May 2002

Fingerprint

Dive into the research topics of 'The importance of being biased'. Together they form a unique fingerprint.

Cite this