Abstract
We consider a variant of the art gallery problem where all guards are limited to seeing to the right inside a monotone polygon. We call such guards: half-guards. We provide a polynomial-time approximation for point guarding the entire monotone polygon. We improve the best known approximation of 40 to 8. We also provide an NP-hardness reduction for point guarding a monotone polygon with half-guards.
Cite
CITATION STYLE
Hillberg, H. M., Krohn, E., & Pahlow, A. (2022). On the Complexity of Half-Guarding Monotone Polygons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13568 LNCS, pp. 761–777). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-20624-5_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
