The robber route problem
- 16 March 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 34 (2) , 59-63
- https://doi.org/10.1016/0020-0190(90)90137-m
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Optimum watchman routesInformation Processing Letters, 1988
- Path planning in 0/1/ weighted regions with applicationsPublished by Association for Computing Machinery (ACM) ,1988
- The weighted region problemPublished by Association for Computing Machinery (ACM) ,1987
- Worst-case optimal algorithms for constructing visibility polygons with holesPublished by Association for Computing Machinery (ACM) ,1986
- Linear time algorithms for visibility and shortest path problems inside simple polygonsPublished by Association for Computing Machinery (ACM) ,1986