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.
| Original language | English GB |
|---|---|
| Volume | abs/1803.02160 |
| State | Published - 2018 |
Publication series
| Name | CoRR |
|---|