Publisher
Springer Berlin Heidelberg
Reference14 articles.
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
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Complexity of Half-Guarding Monotone Polygons;LATIN 2022: Theoretical Informatics;2022
2. On Vertex Guarding Staircase Polygons;LATIN 2022: Theoretical Informatics;2022
3. How to Keep an Eye on Small Things;International Journal of Computational Geometry & Applications;2020-06
4. Minimum Polygons for Fixed Visibility VC-Dimension;Lecture Notes in Computer Science;2018
5. The multi-robot forest coverage for weighted terrain1;Journal of Ambient Intelligence and Smart Environments;2015-11-20