Decomposing Coverings and the Planar Sensor Cover Problem

DOI10.1109/FOCS.2009.54zbMath1292.68144OpenAlexW2110595245MaRDI QIDQ5171172

Kasturi R. Varadarajan, Matthew R. Gibson

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2009.54

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (17)

Maximizing Barrier Coverage Lifetime with Static Sensors ⋮ Coloring planar homothets and three-dimensional hypergraphs ⋮ Indecomposable coverings with concave polygons ⋮ Decomposition of multiple coverings into more parts ⋮ “Green” Barrier Coverage with Mobile Sensors ⋮ Polychromatic colorings of unions of geometric hypergraphs ⋮ Changing of the guards: strip cover with duty cycling ⋮ Octants are cover-decomposable ⋮ Polychromatic coloring for half-planes ⋮ Colorful strips ⋮ ``Green barrier coverage with mobile sensors ⋮ Tight lower bounds for the size of epsilon-nets ⋮ Conflict-free coloring of string graphs ⋮ An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes ⋮ Proper coloring of geometric hypergraphs ⋮ Maximizing barrier coverage lifetime with static sensors ⋮ Maximizing Barrier Coverage Lifetime with Mobile Sensors

This page was built for publication: Decomposing Coverings and the Planar Sensor Cover Problem