An improved algorithm for computing a shortest watchman route for lines (Q1685027)
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: An improved algorithm for computing a shortest watchman route for lines |
scientific article; zbMATH DE number 6817950
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for computing a shortest watchman route for lines |
scientific article; zbMATH DE number 6817950 |
Statements
An improved algorithm for computing a shortest watchman route for lines (English)
0 references
13 December 2017
0 references
computational geometry
0 references
watchman route problem
0 references
dynamic programming
0 references
shortest paths
0 references
0.9178816
0 references
0.91180044
0 references
0.9053186
0 references
0.90099007
0 references
0.89654315
0 references
0.8840876
0 references
0.88199836
0 references
0.88061905
0 references
0.88044924
0 references
