Weighted Geometric Set Multi-cover via Quasi-uniform Sampling

DOI10.1007/978-3-642-33090-2_14zbMath1365.68436OpenAlexW1930431538MaRDI QIDQ2912836

Nikhil Bansal, Kirk R. Pruhs

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/weighted-geometric-set-multicover-via-quasiuniform-sampling(3fc43eb6-15ac-4e1d-b536-4fc847e45da8).html

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (7)

Minimum power partial multi-cover on a line ⋮ Scheduling and fixed-parameter tractability ⋮ Demand Hitting and Covering of Intervals ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks ⋮ Exact multi-covering problems with geometric sets ⋮ A primal-dual algorithm for the minimum power partial cover problem ⋮ Approximation algorithm for minimum partial multi-cover under a geometric setting

This page was built for publication: Weighted Geometric Set Multi-cover via Quasi-uniform Sampling