359 search results - page 3 / 72 » Solving Geometric Covering Problems by Data Reduction |
JDA
2008
13 years 5 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...
COR
2007
13 years 5 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 ...
IPSN
2010
Springer
13 years 11 months ago
2010
Springer
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
CSC
2008
13 years 6 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We consider the problem of transmitting data at rate R over a state dependent channel p(ylx, s) with the state information available at the sender and at the same time conveying th...