370 search results - page 5 / 74 » Improved Approximation Algorithms for Connected Sensor Cover |
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
CCCG
2006
13 years 8 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
AAIM
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
WADS
2005
Springer
14 years 25 days ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...