Sciweavers

Share
CORR
2006
Springer
119views Education» more  CORR 2006»
8 years 8 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 3 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
books