A 4-approximation algorithm for guarding 1.5-dimensional terrains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3887 LNCS, Issue , 2006, Pages 629-640

  King, James ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; QUADRATIC PROGRAMMING;

1.5-DIMENSIONAL TERRAINS; APPROXIMATION FACTOR; TERRAIN GUARDING;

PROBLEM SOLVING;

EID: 33745594016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_58     Document Type: Conference Paper

References (18)

1. A. Aggarwal. The art gallery problem: Its variations, applications, and algorithmic aspects. PhD thesis, Johns Hopkins University, 1984.
2. B. Ben-Moshe. Personal communication, 2005.
3. B. Ben-Moshe, M. Katz, and J. Mitchell. A constant-factor approximation algorithm for optimal terrain guarding. In Symposium on Discrete Algorithms, 2005.
4. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete & Computational Geometry, 14, 1995.
5. D. Z. Chen, V. Estivill-Castro, and J. Urrutia. Optimal guarding of polygons and monotone chains (extended abstract), 1996.
6. V. Chvátal. A combinatorial theorem in plane geometry. J. Comb. Theory Series B, 18:39-41, 1975.
7. K. L. Clarkson and K. Varadarajan, Improved approximation algorithms for geometric set cover. In Symposium on Computational Geometry, 2005.
8. S. Eidenbenz. (In-)Approximability of Visibility Problems on Polygons and Terrains. PhD thesis, ETH Zurich, 2000.
9. S. Eidenbenz. Approximation algorithms for terrain guarding. Information Processing Letters, 82(2):99-105, April 2002.
10. S. Eidenbenz, C. Stamm, and P. Widmayer. Positioning guards at fixed height above a terrain -an optimum inapproximability result. Lecture Notes in Computer Science, 1461, 1998.
11. S. Eidenbenz, C. Stamm, and P. Widmayer. Inapproximability results for guarding polygons and terrains. Algorithmica, 31(1):79-113, 2001.
12. U. Feige. A threshold of Inn for approximating set cover. Journal of the ACM, 45(4):634-652, July 1998.
13. M. Garey and D. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
14. D. Haussler and E. Welzl. ε-Nets and Simplex Range Queries. Discrete & Computational Geometry, 2:127-151, 1987.
15. James King. Approximation algorithms for the 1.5 dimensional terrain guarding problem. Master's thesis, University of British Columbia, 2005.
16. A. A. Kooshesh and B. M. E. Moret. Three-coloring the vertices of a triangulated simple polygon. Pattern Recognition, 25, 1992.
17. D. T. Lee and A. K. Lin. Computational complexity of art gallery problems. IEEE Transactions on Information Theory, 32:276-282, 1986.
18. M. Sharir and P. K. Agarwal. Davenport-Schinzel sequences and their geometric applications. Technical report, 1995.