4255 search results - page 108 / 851 » Cover |
153
Voted
ESA
2011
Springer
14 years 2 months ago
2011
Springer
103
Voted
SCW
2012
IEEE
13 years 10 months ago
2012
IEEE
89
Voted
STACS
2012
Springer
13 years 10 months ago
2012
Springer
95
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
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 proble...