Terrain guarding is NP-hard. (English) Zbl 1288.68095
Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 1580-1593 (2010).
MSC:
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
| 68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |
| 68R10 | Graph theory (including graph drawing) in computer science |
