9572 search results - page 28 / 1915 » Cover Algorithms and Their Combination |
SODA
2000
ACM
13 years 9 months ago
2000
ACM
ESA
2010
Springer
13 years 8 months ago
2010
Springer
ESA
2011
Springer
12 years 7 months ago
2011
Springer
SODA
2012
ACM
11 years 10 months ago
2012
ACM
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...