Sciweavers

1424 search results - page 25 / 285
» The Multi-radius Cover Problem
Sort
View
MP
2010
79views more  MP 2010»
15 years 26 days ago
MIP reformulations of the probabilistic set covering problem
Anureet Saxena, Vineet Goyal, Miguel A. Lejeune
CORR
2010
Springer
67views Education» more  CORR 2010»
14 years 12 months ago
Covering Cubes and the Closest Vector Problem
Friedrich Eisenbrand, Nicolai Hähnle, Martin ...
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 3 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
116
Voted
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
15 years 8 months ago
Vertex Cover Approximations on Random Graphs
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...
Eyjolfur Asgeirsson, Clifford Stein