626

A Threshold of ln n for Approximating Set Cover
– Uriel Feige
 1998

682

Approximation Algorithms for Combinatorial Problems
– D S Johnson
 1974

10988

Computers and Intractability: A Guide to the Theory of NPcompleteness
– M Garey, D Johnson
 1979

260

On the ratio of optimal integral and fractional covers
– L LovĂˇsz
 1975

281

A SubConstant ErrorProbability LowDegree Test, and a SubConstant ErrorProbability PCP Characterization of NP
– Ran Raz , Shmuel Safra
 1997

8557

R.: Introduction to Algorithms
– T Cormen, C Leiserson, Rivest
 1990

390

On the hardness of approximating minimization problems
– C Lund, M Yannakakis
 1994

117

On syntactic versus computational views of approximability
– Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh Vazirani
 1999

12

A modified greedy heuristic for the set covering problem with improved worst case bound
– O Goldschmidt, D S Hochbaum, G Yu
 1993

70

Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract)
– Cristian Mata, et al.

35

A faster approximation algorithm for the Steiner tree problem in graphs
– Alexander Z. Zelikovsky
 1993

145

Improved lowdegree testing and its applications
– Sanjeev Arora, Madhu Sudan
 1997

372

A Greedy Heuristic for the SetCovering Problem
– V Chvatal

577

Optimization, approximation and complexity classes
– C Papadimitriou, M Yannakakis
 1991

718

Proof verification and hardness of approximation problems
– Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
 1992

175

Efficient probabilistically checkable proofs and applications to approximation
– M. Bellare, S. Goldwassert, C. Lundi, A. Russell
 1993

1439

Reducibility among combinatorial problems
– R M Karp
 1972

39

Splitters and NearOptimal Derandomization
– Moni Naor, Leonard J. Schulman, Aravind Srinivasan
 1995

365

Probabilistic checking of proofs: a new characterization of NP
– Sanjeev Arora
 1998
