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

• Type: Conference
• Year: 2002
• Where: STOC
• Authors: Irit Dinur, Shmuel Safra
• Keywords: Algorithms, STOC 2002, Vertex Cover Problem