For the continuous minimum-membership geometric set cover problem, the paper provides constant-factor approximation algorithms for squares, hypercubes, disks, and convex polygons, and proves NP-hardness for the minimum 1-ply unit square cover.
In: Canadian Conference on Computational Geometry (2012), https://api.semanticscholar.org/CorpusID:16280099
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Minimum Membership Geometric Set Cover in the Continuous Setting
For the continuous minimum-membership geometric set cover problem, the paper provides constant-factor approximation algorithms for squares, hypercubes, disks, and convex polygons, and proves NP-hardness for the minimum 1-ply unit square cover.