A constant-factor approximation for multi-covering with disks
From MaRDI portal
Publication:2970422
DOI10.20382/jocg.v6i1a9zbMath1405.68438arXiv1407.5674OpenAlexW2295960887MaRDI QIDQ2970422
Santanu Bhowmick, Shi-Ke Xue, Kasturi R. Varadarajan
Publication date: 30 March 2017
Full work available at URL: https://arxiv.org/abs/1407.5674
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (8)
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 ⋮ Anchored rectangle and square packings ⋮ 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
This page was built for publication: A constant-factor approximation for multi-covering with disks
