@inproceedings{62771b6871594c878fcb4037def2575b,
title = "Robustly Guarding Polygons",
abstract = "We propose precise notions of what it means to guard a domain “robustly”, under a variety of models. While approximation algorithms for minimizing the number of (precise) point guards in a polygon is a notoriously challenging area of investigation, we show that imposing various degrees of robustness on the notion of visibility coverage leads to a more tractable (and realistic) problem for which we can provide approximation algorithms with constant factor guarantees.",
keywords = "approximation algorithms, geometric optimization, guarding",
author = "Rathish Das and Omrit Filtser and Katz, \{Matthew J.\} and Mitchell, \{Joseph S.B.\}",
note = "Publisher Copyright: {\textcopyright} Rathish Das, Omrit Filtser, Matthew J. Katz, and Joseph S.B. Mitchell.; 40th International Symposium on Computational Geometry, SoCG 2024 ; Conference date: 11-06-2024 Through 14-06-2024",
year = "2024",
month = jun,
day = "1",
doi = "10.4230/LIPIcs.SoCG.2024.47",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Wolfgang Mulzer and Phillips, \{Jeff M.\}",
booktitle = "40th International Symposium on Computational Geometry, SoCG 2024",
address = "Germany",
}