1486 search results - page 25 / 298 » Algorithms for two-box covering |
WEA
2005
Springer
14 years 1 months ago
2005
Springer
ESA
2006
Springer
14 years 4 days ago
2006
Springer
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
IPL
2008
13 years 8 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
MSS
2008
IEEE
13 years 8 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...