Exponential-time approximation of weighted set cover

A threshold of ln <i>n</i> for approximating set cover

Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

Parameterized Complexity

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

Computing, Computer Science, Mathematics +12

Clique is hard to approximate within n1−ε

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

Computing, Computer Science, Algorithms +3

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Óscar H. Ibarra, Chul E. Kim · Journal of the ACM · 1975 · 959 citations · Full text

Computing, Computer Science, Mathematics +11

Clique is hard to approximate within n/sup 1-ε/

Johan Håstad · 2002 · 452 citations

Computing, Computer Science, Algorithms +13