Maximizing the guarded boundary of an art gallery is APX-complete

Computational Geometry: Theory and Applications

Volumn 38, Issue 3, 2007, Pages 170-180

  Fragoudakis, Christodoulos ^a   Markou, Euripides ^b,d   Zachos, Stathis ^a,c  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF ATHENS   (Greece)

^c CITY UNIVERSITY OF NEW YORK   (United States)

^d MCMASTER UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Art gallery; Visibility

Indexed keywords

EID: 84867921296     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2006.12.001     Document Type: Conference Paper

References (22)

1. S. Arora, Probabilistic checking of proofs and the hardness of approximation problems, Ph.D. Thesis, UC Berkeley, 1994
2. S. Arora, and C. Lund Hardness of Approximations D. Hochbaum, Approximation Algorithms for NP-Hard Problems 1996 PWS Publishing Company Boston 399 446
3. B. Broden, M. Hammar, B.J. Nilson, Guarding lines and 2-link polygons is APX-hard, in: Proc. 13th Canadian Conf. on Computational Geometry, CCCG'01, 2001, pp. 45-48
4. S. Carlsson, H. Jonsson, Guarding a treasury, in: Proc. 5th Canadian Conf. on Computational Geometry, 1993, pp. 85-90
5. O. Cheong, A. Efrat, S. Har-Peled, On finding a guard that sees most and a shop that sells most, in: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, 2004, pp. 1098-1107
6. L.L. Deneen, S. Joshi, Treasures in an art gallery, in: Proc. 4th Canadian Conf. Computational Geometry, 1992, pp. 17-22
7. S. Eidenbenz, (In-)Approximability of visibility problems on polygons and terrains, Ph.D. Thesis, ETH Zurich, 2000
8. S. Eidenbenz Inapproximability results for guarding polygons without holes Proc. ISAAC'98 Lecture Notes in Computer Science vol. 1533 1998 Springer Berlin 427 436
9. S. Eidenbenz, C. Stamm, P. Widmayer, Inapproximability of some Art Gallery problems, in: Proc. 10th Canadian Conf. Computational Geometry (CCCG'98), 1998, pp. 64-65
10. I. Emiris, C. Fragoudakis, E. Markou, Maximizing the guarded interior of an Art Gallery, in: Proc. 22nd European Workshop on Computational Geometry, 2006, pp. 165-168
11. S. Ghosh, Approximation algorithms for Art Gallery problems, in: Proc. Canadian Information Processing Society Congress, 1987, pp. 429-434
12. A. Laurentini Guarding the walls of an art gallery The Visual Computer Journal 15 1999 265 278
13. D. Lee, and A. Lin Computational complexity of art gallery problems IEEE Trans. Inform. Theory 32 1986 276 282
14. E. Markou, Approximation algorithms for near-optimal covering of polygonal regions, Ph.D. Thesis, School of Electrical and Computer Engineering, National Technical University of Athens, 2003
15. E. Markou, C. Fragoudakis, S. Zachos, Approximating visibility problems within a constant, in: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, 2002, pp. 91-103
16. E. Markou, S. Zachos, C. Fragoudakis, Budgeted coverage of a maximum part of a polygonal area, in: Proc. 1st Balkan Conference on Informatics, 2003, pp. 174-182
17. B.J. Nilson, Guarding Art Galleries - methods for mobile guards, Ph.D. Thesis, Lund University, 1995
18. B.J. Nilsson, Approximate guarding of monotone and rectilinear polygons, Proc. ICALP'05, 2005, pp. 1362-1373
19. S. Ntafos, and M. Tsoukalas Optimum placement of guards Info. Sciences 76 1994 141 150
20. J. O'Rourke Art Gallery Theorems and Algorithms 1987 Oxford Univ. Press New York
21. T. Shermer, Recent results in Art Galleries, in: Proc. of the IEEE, vol. 80, 1992, pp. 1384-1399
22. J. Urrutia Art Gallery and illumination problems R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 North-Holland Amsterdam 973 1027