156 search results - page 1 / 32 » Decomposing Coverings and the Planar Sensor Cover Problem |
100
Voted
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
108
Voted
CORR
2006
Springer
14 years 10 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...
92
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
81
Voted
WG
2007
Springer
15 years 4 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
90
Voted
FGCN
2007
IEEE
15 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...