Sciweavers

4255 search results - page 108 / 851
» Cover
Sort
View
153
Voted
ESA
2011
Springer
242views Algorithms» more  ESA 2011»
14 years 2 months ago
Cover-Decomposition and Polychromatic Numbers
Béla Bollobás, David Pritchard, Thom...
103
Voted
SCW
2012
IEEE
13 years 10 months ago
The minimal covering set in large tournaments
Alex Scott, Mark Fey
89
Voted
STACS
2012
Springer
13 years 10 months ago
Preemptive and Non-Preemptive Generalized Min Sum Set Cover
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan
95
Voted
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
16 years 2 months 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 proble...
Irit Dinur, Shmuel Safra