On the complexity of minimum-link path problems (Q3132885)
From MaRDI portal
!
WARNING
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 6832306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of minimum-link path problems |
scientific article; zbMATH DE number 6832306 |
Statements
30 January 2018
0 references
minimum-link path
0 references
diffuse reflection
0 references
terrain
0 references
bit-complexity
0 references
NP-hardness
0 references
On the complexity of minimum-link path problems (English)
0 references
0.8082413077354431
0 references
0.7956949472427368
0 references
0.7904165983200073
0 references
0.7874614596366882
0 references
