Searching for "Optimum Watchman Routes." – sorted by Relevance.
-
Watchman Routes in the Presence of a Pair of Convex Polygons
- watchman route is a watchman route of minimum length. The optimum watchman route problem is known to be NP
- Cited by 6 (0 self) – Add To MetaCart

