文章基本信息
- 标题：The Importance of Being Biased
- 本地全文：下载
- 作者：Irit Dinur, Shmuel Safra
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2001
- 卷号：2001
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：We show Minimum Vertex Cover NP-hard to approximate to within a factor of 1.3606. This improves on the previously known factor of 7/6.
- 关键词：Approximation Hardness , Vertex Cover
