ProV Logo
0

Decomposition of Multiple Coverings into...
Aloupis, G....
Decomposition of Multiple Coverings into More Parts by Aloupis, G. ( Author )
N.A
01-01-1970
We prove that for every centrally symmetric convex polygon Q, there exists a constant alpha such that any alpha*k-fold covering of the plane by translates of Q can be decomposed into k coverings. This improves on a quadratic upper bound proved by Pach and Toth (SoCG'07). The question is motivated by a sensor network problem, in which a region has to be monitored by sensors with limited battery lifetime.
-
Article
pdf
38.10 KB
English
-
MYR 0.00
-
doi:10.1007/s00454-009-9238-3
Share this eBook