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 the normal view instead:
scientific article; zbMATH DE number 4178771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.953389286994934
0 references
0.9385604858398438
0 references
0.9205887317657472
0 references
0.919279396533966
0 references
0.9009047150611876
0 references
