Polychromatic coloring for half-planes
Journal of Combinatorial Theory Series A
Maximizing network lifetime on the line with adjustable sensing ranges
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Changing of the guards: strip cover with duty cycling
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Brief announcement: set it and forget it - approximating the set once strip cover problem
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
ACM Transactions on Sensor Networks (TOSN)
Octants are cover-decomposable into many coverings
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We prove that for every centrally symmetric convex polygon Q, there exists a constant α such that any locally finite α 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 Tóth. The question is motivated by a sensor network problem, in which a region has to be monitored by sensors with limited battery life.