33

Covering problems with hard capacities
– Julia Chuzhoy, Joseph (Seffi )Naor
 2002

158

A localratio theorem for approximating the weighted vertex cover problem
– R BarYehuda, S Even
 1985

626

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

648

Some optimal inapproximability results
– Johan Håstad
 2002

16

Capacitated vertex covering
– Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or
 2003

281

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

31

Hardness of approximate hypergraph coloring
– Venkatesan Guruswami, Madhu Sudan

78

NonApproximability Results for Optimization Problems on Bounded Degree Instances
– Luca Trevisan
 2001

89

Free Bits, PCPs, and Nonapproximability—Towards Tight Results
– M Bellare, O Goldreich, M Sudan
 1998

238

On the power of unique 2prover 1round games
– Subhash Khot
 2002

577

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

324

A Parallel Repetition Theorem
– Ran Raz
 1998

14

Improved approximation algorithms for the partial vertex cover problem
– Eran Halperin
 2002

1439

Reducibility among combinatorial problems
– R M Karp
 1972

682

Approximation Algorithms for Combinatorial Problems
– D S Johnson
 1974

62

A linear time approximation algorithm for the weighted vertex cover problem
– R BarYehuda, S Even
 1981

67

Clique is hard to approximate within n 1
– J Hastad
 1996

10

Computing small partial coverings
– M Bläser

894

Parameterized Complexity
– Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen
 1998
