Inapproximability results for guarding polygons without holes

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

Volumn 1533 LNCS, Issue , 1998, Pages 427-437

  Eidenbenz, Stephan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; ART GALLERY PROBLEM; EDGE GUARDS; INAPPROXIMABILITY; NP-HARD; POLYNOMIAL-TIME ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84867484577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_45     Document Type: Conference Paper

References (14)

1. P. Bose, T. Shermer, G. Toussaint and B. Zhu; Guarding Polyhedral Terrains; Computational Geometry 7, pp. 173-185, Elsevier Science B. V., 1997.
2. S. Arora, C. Lund; Hardness of Approximations; in: Approximation Algorithms for NP-Hard Problems (ed. Dorit Hochbaum), PWS Publishing Company, pp. 399-446, 1996.
3. D. P. Bovet and P. Crescenzi; Introduction to the Theory of Complexity; Prentice Hall, 1993.
4. J. C. Culberson and R. A. Reckhow; Covering Polygons is Hard; Proc. 29th Symposium on Foundations of Computer Science, 1988.
5. St. Eidenbenz, Ch. Stamm, P. Widmayer; Positioning Guards at Fixed Height above a Terrain - an Optimum Inapproximability Result; to appear in Proceedings ESA, 1998.
6. St. Eidenbenz, Ch. Stamm, P. Widmayer; Inapproximability of some Art Gallery Problems; to appear in Proceedings CCCG, 1998.
7. S. Ghosh; Approximation Algorithms for Art Gallery Problems; Proc. of the Canadian Information Processing Society Congress, 1987.
8. D. T. Lee and A. K. Lin; Computational Complexity of Art Gallery Problems; in IEEE Trans. Info. Th, pp. 276-282, IT-32 (1986).
9. B. Nilsson; Guarding Art Galleries - Methods for Mobile Guards; doctoral thesis, Department of Computer Science, Lund University, 1994.
10. J. O'Rourke and K. J. Supowit; Some NP-hard Polygon Decomposition Problems; IEEE Transactions on Information Theory, Vol IT-29, No. 2, 1983.
11. J. O'Rourke; Art Gallery Theorems and Algorithms; Oxford University Press, New York (1987).
12. C.H. Papadimitriou and M. Yannakakis; Optimization, Approximation, and Complexity Classes; Proc. 20th ACM Symposium on the Theory of Computing, 1988.
13. T. Shermer; Recent Results in Art Galleries; Proc. of the IEEE, 1992.
14. J. Urrutia; Art Gallery and Illumination Problems; to appear in Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia, 1998.