1566 search results - page 42 / 314 » On a Cone Covering Problem |
129
click to vote
ICCNMC
2005
Springer
15 years 11 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
190
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
198
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
170
click to vote
KI
2007
Springer
16 years 3 days ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...