A note on multicovering with disks
From MaRDI portal
Publication:1931286
DOI10.1016/j.comgeo.2012.10.006zbMath1257.68145OpenAlexW2017749380MaRDI QIDQ1931286
Dror Rawitz, Reuven Bar Yehuda
Publication date: 25 January 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.10.006
Network design and communication in computer systems (68M10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
Fault-tolerant covering problems in metric spaces, Minimum power partial multi-cover on a line, Approximation algorithms for the minimum power cover problem with submodular/linear penalties, An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem, A PTAS for the disk cover problem of geometric objects, Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks, A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem, A primal-dual algorithm for the minimum power partial cover problem, Experiments with unit disk cover algorithms for covering massive pointsets