A Threshold of ln n for Approximating Set Cover (1998)

by Uriel Feige
Venue:JOURNAL OF THE ACM
Citations:622 - 6 self

Active Bibliography

718 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
7 Robust PCPs of proximity and shorter PCPs – Prahladh Harsha - 2004
208 Free Bits, PCPs and Non-Approximability -- Towards Tight Results – Mihir Bellare, Oded Goldreich, Madhu Sudan - 1996
Probabilistic Verification of Proofs – Madhu Sudan - 1998
26 Inapproximability of combinatorial optimization problems – Luca Trevisan - 2004
13 The approximability of NP-hard problems – Sanjeev Arora - 1998
648 Some optimal inapproximability results – Johan Håstad - 2002
1 How NP Got a New Definition: A Survey of Probabilistically Checkable Proofs ∗ – Sanjeev Arora - 2003
11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
31 Small PCPs With Low Query Complexity – Prahladh Harsha - 2000
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
Interactive and probabilistic proof-checking – Luca Trevisan - 2000
5 Probabilistic Proof Systems -- A Survey – Oded Goldreich - 1996
33 Clique is Hard to Approximate within ... – Johan Håstad - 2002
6 Interactive PCP – Yael Tauman Kalai, Ran Raz - 2008
15 A Taxonomy of Proof Systems – Oded Goldreich - 1997
The Weizmann Workshop on Probabilistic Proof Systems – Uriel Feige, Shafi Goldwasser (Eds.), Shafi Goldwasser - 1994
DOI 10.1007/s00453-007-9033-6 Quantum Information and the PCP Theorem – Ran Raz
4 On Dinur’s Proof of the PCP Theorem – Jaikumar Radhakrishnan, Madhu Sudan - 2006