WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED
From MaRDI portal
Publication:2968086
DOI10.20382/jocg.v3i1a4zbMath1404.68192OpenAlexW1870040444MaRDI QIDQ2968086
Publication date: 9 March 2017
Full work available at URL: https://dblp.uni-trier.de/db/journals/jocg/jocg3.html#Har-PeledL12
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Approximation algorithms (68W25)
Related Items
A PTAS for the Weighted Unit Disk Cover Problem ⋮ Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces ⋮ Exact algorithms and APX-hardness results for geometric packing and covering problems ⋮ Capacitated covering problems in geometric spaces ⋮ On the geometric priority set cover problem ⋮ Improved bounds for metric capacitated covering problems ⋮ Geometric dominating-set and set-cover via local-search ⋮ Unnamed Item ⋮ A PTAS for the cardinality constrained covering with unit balls ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ Multi Cover of a Polygon Minimizing the Sum of Areas ⋮ Capacitated Covering Problems in Geometric Spaces ⋮ Finding, hitting and packing cycles in subexponential time on unit disk graphs
