Finding the best shortcut in a geometric network (Q5370629)
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 6794179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the best shortcut in a geometric network |
scientific article; zbMATH DE number 6794179 |
Statements
Finding the best shortcut in a geometric network (English)
0 references
20 October 2017
0 references
approximation algorithms
0 references
computational geometry
0 references
geometric networks
0 references
0.8630625605583191
0 references
0.8596290349960327
0 references
0.8228234052658081
0 references
0.820199191570282
0 references
0.8083957433700562
0 references
