On the set multi-cover problem in geometric settings

DOI10.1145/1542362.1542421zbMath1388.68286OpenAlexW2166022623MaRDI QIDQ5370734

Kenneth L. Clarkson, Chandra Chekuri, Sariel Har-Peled

Publication date: 20 October 2017

Published in: Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1542362.1542421

zbMATH Keywords

set covercuttingsLP rounding

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Geometric Packing under Nonuniform Constraints ⋮ A PTAS for the cardinality constrained covering with unit balls ⋮ \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets ⋮ Multi Cover of a Polygon Minimizing the Sum of Areas ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks