A constant-factor approximation for multi-covering with disks

DOI10.1145/2462356.2462400zbMath1305.68335OpenAlexW2120094821MaRDI QIDQ5174484

Santanu Bhowmick, Shi-Ke Xue, Kasturi R. Varadarajan

Publication date: 17 February 2015

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

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

zbMATH Keywords

approximation algorithmsgeometric set cover

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (4)

Fault-tolerant covering problems in metric spaces ⋮ Minimum power partial multi-cover on a line ⋮ Parallel approximation for partial set cover ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks

This page was built for publication: A constant-factor approximation for multi-covering with disks