Inapproximability results for guarding polygons and terrains

Algorithmica (New York)

Volumn 31, Issue 1, 2001, Pages 79-113

  Eidenbenz, S ^a   Stamm, C ^a   Widmayer, P ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Art gallery; Gap preserving reductions; Inapproximability; Telecommunications; Terrains; Visibility problems

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; TELECOMMUNICATION;

POLYGONS;

PROBLEM SOLVING;

EID: 0038087127     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0040-8     Document Type: Article

References (27)

1. A. Aggarwal, S. Ghosh, and R. Shyamasundar; Computational complexity of restricted polygon decompositions; in Computational Morphology (ed. G. Toussaint), pp. 1-11; North-Holland, Amsterdam, 1988.
2. S. Arora and C. Lund; Hardness of approximations; in Approximation Algorithms for NP-Hard Problems (ed. D. Hochbaum), pp. 399-446; PWS, Boston, MA, 1996.
3. S. Arora and M. Sudan; Improved low-degree testing and its applications; Proc. 29th ACM Symposium on the Theory of Computing, pp. 485-495, 1997.
4. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi; A list of NP optimization problems; in Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, pp. 367-470; Springer-Verlag, Berlin, 1999; also available in an online version at http://www.nada.kth.se/theory/compendium/.
5. P. Bose, T. Shermer, G. Toussaint, and B. Zhu; Guarding polyhedral terrains; in Computational Geometry 7, pp. 173-185; Elsevier Science, Amsterdam, 1997.
6. D. P. Bovet and P. Crescenzi; Introduction to the Theory of Complexity; Prentice-Hall, Englewood Cliffs, NJ, 1993.
7. P. Crescenzi and L. Trevisan; On approximation scheme preserving reducibility and its applications, Proc. 14th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 330-341; Lecture Notes in Computer Science, Vol. 880; Springer-Verlag, Berlin, 1994.
8. J. C. Culberson and R. A. Reckhow; Covering polygons is hard; Proc. 29th Symposium on Foundations of Computer Science, pp. 601-605, 1988.
9. S. Eidenbenz; Inapproximability Results for Guarding Polygons without Holes, pp. 421-436; Lecture Notes in Computer Science, Vol. 1533; Springer-Verlag, Berlin, 1998.
10. S. Eidenbenz, C. Stamm, and P. Widmayer; Inapproximability of some art gallery problems; Proc. 10th Canadian Conference on Computational Geometry, pp. 64-65, 1998.
11. S. Eidenbenz, C. Stamm, and P. Widmayer; Positioning Guards at Fixed Height above a Terrain - An Optimum Inapproximability Result, pp. 187-198; Lecture Notes in Computer Science, Vol. 1461; Springer-Verlag, Berlin, 1998.
12. U. Feige; A threshold of In n for approximating set cover; Journal of the ACM, Vol. 45 No. 4, pp. 634-652, 1998; a preliminary version appeared in Proc. 28th ACM Symposium on the Theory of Computing, pp. 314-318, 1996.
13. U. Feige; A threshold of In n for approximating set cover; Journal of the ACM, Vol. 45 No. 4, pp. 634-652, 1998; a preliminary version appeared in Proc. 28th ACM Symposium on the Theory of Computing, pp. 314-318, 1996.
14. S. Ghosh; Approximation algorithms for art gallery problems; Proc. Canadian Information Processing Society Congress, 1987.
15. D. Johnson; Approximation algorithms for combinatorial problems; Journal of Computer and System Sciences, Vol. 9, pp. 256-278, 1974.
16. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani; On syntactic versus computational views of approximability ; Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 819-830, 1994.
17. M. van Kreveld; Digital elevation models and TIN algorithms; in Algorithmic Foundations of Geographic Information Systems (ed. van Kreveld et al.), pp. 37-78; Lecture Notes in Computer Science, Vol. 1340; Springer-Verlag, Berlin, 1997.
18. D. T. Lee and A. K. Lin; Computational complexity of art gallery problems; IEEE Transactions on Information Theory, Vol. 32, pp. 276-282, 1986.
19. B. Nilsson; Guarding Art Galleries - Methods for Mobile Guards; Doctoral thesis. Department of Computer Science, Lund University, 1994.
20. J. O'Rourke; Art Gallery Theorems and Algorithms; Oxford University Press, New York, 1987.
21. J. O'Rourke and K. J. Supowit; Some NP-hard polygon decomposition problems; IEEE Transactions on Information Theory, Vol. 29, No. 2, pp. 181-190, 1983.
22. C. H. Papadimitriou and M. Yannakakis; Optimization, approximation, and complexity classes; Proc. 20th ACM Symposium on the Theory of Computing, pp. 229-234, 1988.
23. R. Raz and S. Safra; A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP; Proc. 29th ACM Symposium on the Theory of Computing, pp. 475-484, 1997.
24. T. Shermer; Recent results in art galleries; Proceedings of the IEEE, Vol. 80, pp. 1384-1399, 1992.
25. L. Trevisan; Reductions and (Non-)Approximability, Doctoral thesis, 1997.
26. J. Urrutia; Art gallery and illumination problems; in Handbook on Computational Geometry (ed. J.-R. Sack and J. Urrutia); pp. 973-1027; North-Holland, Amsterdam, 2000.
27. B. Zhu; Computing the shortest watchtower of a polyhedral terrain in O (n log n) time; in Computational Geometry 8, pp. 181-193; Elsevier Science, Amsterdam, 1997.