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

by Uriel Feige
Venue:JOURNAL OF THE ACM
Citations:657 - 5 self

Active Bibliography

726 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
Probabilistic Verification of Proofs – Madhu Sudan
649 Some optimal inapproximability results – Johan HÃ¥stad - 2002
8 Robust PCPs of proximity and shorter PCPs – Prahladh Harsha - 2004
General Terms – Madhu Sudan
unknown title – unknown authors
27 Inapproximability of combinatorial optimization problems – Luca Trevisan - 2004
15 The approximability of NP-hard problems – Sanjeev Arora - 1998
31 Small PCPs With Low Query Complexity – Prahladh Harsha - 2000