Improved Approximation for Guarding Simple Galleries from the Perimeter

We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for building -nets of size O 1 log log 1 for the instances of Hitting Set associated with our guarding problem. We then apply the technique of Br

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: James King, David G. Kirkpatrick
• Keywords: Algorithms, CORR 2010, Education, Potential Guard Locations, Simple Polygon