A (2+ε)-approximation algorithm for vertex guarding weakly visible polygons, plus related results for boundary guards and chord-visible polygons.
PTAS for geometric hitting set problems via local search
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon
A (2+ε)-approximation algorithm for vertex guarding weakly visible polygons, plus related results for boundary guards and chord-visible polygons.