1424 search results - page 30 / 285 » The Multi-radius Cover Problem |
128
click to vote
STACS
2005
Springer
15 years 6 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...
115
click to vote
KI
2007
Springer
15 years 6 months 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 ...
102
click to vote
CORR
2008
Springer
15 years 24 days 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...
98
Voted
IPCO
2010
15 years 2 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
105
click to vote
DAM
1999
15 years 11 days ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...