1424 search results - page 5 / 285 » The Multi-radius Cover Problem |
ALGORITHMICA
2010
13 years 10 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
JDA
2008
13 years 9 months ago
2008
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
FGCN
2007
IEEE
14 years 4 months ago
2007
IEEE
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
FSTTCS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
COR
2007
13 years 9 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...