A PTAS for vertex guarding weakly-visible polygons - An extended abstract
Computational Geometry
2018-10-02 v2
Abstract
In this extended abstract, we present a PTAS for guarding the vertices of a weakly-visible polygon 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 . We then show how to obtain a PTAS for vertex guarding 's boundary.
Cite
@article{arxiv.1803.02160,
title = {A PTAS for vertex guarding weakly-visible polygons - An extended abstract},
author = {Matthew J. Katz},
journal= {arXiv preprint arXiv:1803.02160},
year = {2018}
}