An Approximation Scheme for Terrain Guarding

Authors:
Matt Gibson;Gaurav Kanade;Erik Krohn;Kasturi Varadarajan
Affiliations:
Department of Computer Science, University of Iowa, Iowa City, USA 52242-1419;Department of Computer Science, University of Iowa, Iowa City, USA 52242-1419;Department of Computer Science, University of Iowa, Iowa City, USA 52242-1419;Department of Computer Science, University of Iowa, Iowa City, USA 52242-1419
Venue:
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Year:
2009

Citing 12
Cited 3

Computational complexity of art gallery problems

IEEE Transactions on Information Theory
Fast algorithms for shortest paths in planar graphs, with applications

SIAM Journal on Computing
Inapproximability Results for Guarding Polygons without Holes

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Improved approximation algorithms for geometric set cover

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A constant-factor approximation algorithm for optimal terrain guarding

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
Guarding galleries and terrains

Information Processing Letters
PTAS for geometric hitting set problems via local search

Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximation algorithms for maximum independent set of pseudo-disks

Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximate guarding of monotone and rectilinear polygons

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A 4-approximation algorithm for guarding 1.5-dimensional terrains

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Terrain guarding is NP-hard

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Terrain Guarding is NP-Hard

SIAM Journal on Computing
Approximation algorithms for art gallery problems in polygons and terrains

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.