Sciweavers

Share
190 search results - page 1 / 38
» Restricted Strip Covering and the Sensor Cover Problem
Sort
View
CORR
2006
Springer
119views Education» more  CORR 2006»
8 years 10 months ago
Restricted Strip Covering and the Sensor Cover Problem
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...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
FOCS
2009
IEEE
9 years 4 months ago
Decomposing Coverings and the Planar Sensor Cover Problem
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an eļ¬ƒcient algorithm). We generalize this result to ...
Matt Gibson, Kasturi R. Varadarajan
TCS
2016
3 years 6 months ago
Changing of the guards: Strip cover with duty cycling
The notion of duty cycling is common in problems which seek to maximize the lifetime of a wireless sensor network. In the duty cycling model, sensors are grouped into shifts that ...
Amotz Bar-Noy, Ben Baumer, Dror Rawitz
MOBIHOC
2008
ACM
9 years 9 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
9 years 3 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
books