The importance of being biased

Irit Dinur; Shmuel Safra

doi:10.1145/509914.509915

The importance of being biased

Irit Dinur, Shmuel Safra^*

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Conference article › peer-review

150 Scopus citations

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 language	English
Pages (from-to)	33-42
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/509914.509915
State	Published - 2002
Event	Proceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada Duration: 19 May 2002 → 21 May 2002

Access to Document

10.1145/509914.509915

Cite this

@article{6cd0c7bb33a2415f8b568f3e177824d2,

title = "The importance of being biased",

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.",

author = "Irit Dinur and Shmuel Safra",

year = "2002",

doi = "10.1145/509914.509915",

language = "אנגלית",

pages = "33--42",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "Proceedings of the 34th Annual ACM Symposium on Theory of Computing ; Conference date: 19-05-2002 Through 21-05-2002",

}

TY - JOUR

T1 - The importance of being biased

AU - Dinur, Irit

AU - Safra, Shmuel

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036038679&partnerID=8YFLogxK

U2 - 10.1145/509914.509915

DO - 10.1145/509914.509915

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0036038679

SN - 0734-9025

SP - 33

EP - 42

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 34th Annual ACM Symposium on Theory of Computing

Y2 - 19 May 2002 through 21 May 2002

ER -

The importance of being biased

Abstract

Access to Document

Other files and links

Fingerprint

Cite this