An Approximation Scheme for Terrain Guarding

We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled [2] and Mustafa and Ray [15]. Our key contribution is to show the existence of a planar graph that appropriately relates the local and global optimum.

• Type: Conference
• Year: 2009
• Where: APPROX
• Authors: Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan
• Keywords: Algorithms, APPROX 2009, Local Search Algorithm, Polynomial Time Approximation Scheme, Terrain Guarding Problem