The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

Mathematical Programming, Engineering, Parameterized Complexity +13

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

On the power of unique 2-prover 1-round games

Subhash Khot · 2002 · 841 citations

Non-cooperative Game Theory, Unique Games Conjecture, Round Games +11

Vertex cover might be hard to approximate to within<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>2</mml:mn><mml:mo>−</mml:mo><mml:mi>ε</mml:mi></mml:math>

Subhash Khot, Oded Regev · Journal of Computer and System Sciences · 2007 · 752 citations

On the hardness of approximating vertex cover

Irit Dinur, Samuel Safra · Annals of Mathematics · 2005 · 631 citations · Full text

Mathematical Programming, Engineering, Approximation Technique.to +16