Optimum watchman routes
- 1 May 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 28 (1), 39-44
- https://doi.org/10.1016/0020-0190(88)90141-x
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977