Sciweavers

STOC
2002
ACM

The importance of being biased

15 years 7 days ago
The importance of being biased
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this problem to within any factor smaller than 10
Irit Dinur, Shmuel Safra
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2002
Where STOC
Authors Irit Dinur, Shmuel Safra
Comments (0)