Vertex cover might be hard to approximate to within <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mn>2</mml:mn><mml:mo>−</mml:mo><mml:mi>ε</mml:mi></mml:math>-Reference-Cited by-同舟云学术

Vertex cover might be hard to approximate to within 2−ε

Published:2008-05 Issue:3 Volume:74 Page:335-349
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Khot Subhash,Regev Oded

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference30 articles.

1. S. Arora, B. Bollobás, L. Lovász, Proving integrality gaps without knowing the linear program, in: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, Canada, Nov. 2002, pp. 313–322

2. Proof verification and the hardness of approximation problems;Arora;J. ACM,1998

3. Probabilistic checking of proofs: A new characterization of NP;Arora;J. ACM,1998

4. Free bits, PCPs, and nonapproximability—Towards tight results;Bellare;SIAM J. Comput.,1998

5. M. Charikar, K. Makarychev, Y. Makarychev, Near-optimal algorithms for unique games, in: Proceedings of the 38th ACM Symposium on Theory of Computing, STOC 2006

Cited by 438 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximating power node-deletion problems;Theoretical Computer Science;2024-10

2. Parameterized Approximation Algorithms for Weighted Vertex Cover;Theoretical Computer Science;2024-09

3. Manipulating the outcome of stable marriage and roommates problems;Games and Economic Behavior;2024-09

4. Algebraic Approach to Approximation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

5. Computational complexity and algorithms for two scheduling problems under linear constraints;Journal of Combinatorial Optimization;2024-04-14