A (2+ε)-approximation algorithm for vertex guarding weakly visible polygons, plus related results for boundary guards and chord-visible polygons.
A PTAS for vertex guarding weakly-visible polygons - An extended abstract
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In this extended abstract, we present a PTAS for guarding the vertices of a weakly-visible polygon $P$ from a subset of its vertices, or in other words, a PTAS for computing a minimum dominating set of the visibility graph of the vertices of $P$. We then show how to obtain a PTAS for vertex guarding $P$'s boundary.
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.