Weighted geometric set multi-cover via quasi-uniform sampling

DOI10.20382/jocg.v7i1a11zbMath1405.68396OpenAlexW2416034390MaRDI QIDQ2970451

Nikhil Bansal, Kirk R. Pruhs

Publication date: 30 March 2017

Full work available at URL: https://doi.org/10.20382/jocg.v7i1a11

Mathematics Subject Classification ID

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

Related Items (6)

On the geometric set multicover problem ⋮ On the geometric priority set cover problem ⋮ Geometric stabbing via threshold rounding and factor revealing LPs ⋮ Approximation algorithms for highly connected multi-dominating sets in unit disk graphs ⋮ Unnamed Item ⋮ Local search strikes again: PTAS for variants of geometric covering and packing

This page was built for publication: Weighted geometric set multi-cover via quasi-uniform sampling