Shortest watchman routes in simple polygons (Q751818)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Shortest watchman routes in simple polygons |
scientific article; zbMATH DE number 4178771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest watchman routes in simple polygons |
scientific article; zbMATH DE number 4178771 |
Statements
Shortest watchman routes in simple polygons (English)
0 references
1991
0 references
polynomial-time algorithm
0 references
simple polygons
0 references
watchman-route problem
0 references
NP- hard
0 references
0 references
