TY - UNPB
T1 - A PTAS for vertex guarding weakly-visible polygons
T2 - An extended abstract
AU - Katz, Matthew J.
PY - 2018/9
Y1 - 2018/9
N2 - 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.
AB - 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.
U2 - 10.48550/arXiv.1803.02160
DO - 10.48550/arXiv.1803.02160
M3 - Preprint
VL - abs/1803.02160
T3 - CoRR
BT - A PTAS for vertex guarding weakly-visible polygons
ER -