A PTAS for vertex guarding weakly-visible polygons - An extended abstract
classification
💻 cs.CG
keywords
ptasguardingverticesabstractextendedvertexweakly-visibleboundary
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.