An approximation algorithm for the total covering problem

Approximation algorithms for combinatorial problems

David S. Johnson · Journal of Computer and System Sciences · 1974 · 2.2K citations

Natural Sciences, Computer Science, Mathematics +12

On the hardness of approximating vertex cover

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

Computing, Computer Science, Mathematics +15

Approximation of <i>k</i>-set cover by semi-local optimization

Rong-chii Duh, Martin Fürer · 1997 · 149 citations · Full text

Computing, Computer Engineering, Computer Science +12

Vertex cover might be hard to approximate to within 2-ε

Subhash Khot, Oded Regev · 2004 · 98 citations

Computing, Computer Science, Mathematics +10

On the algorithmic complexity of twelve covering and independence parameters of graphs

David F. Manlove · Discrete Applied Mathematics · 1999 · 52 citations

Computing, Computer Science, Mathematics +13