Robust, almost constant time shortest-path queries in road networks (Q3574267)
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 5734727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust, almost constant time shortest-path queries in road networks |
scientific article; zbMATH DE number 5734727 |
Statements
9 July 2010
0 references
shortest paths
0 references
routing
0 references
graph
0 references
road network
0 references
speed-up technique
0 references
hierarchy
0 references
preprocessing
0 references
0.9187098145484924
0 references
0.8820939660072327
0 references
0.8795109987258911
0 references
0.8774691224098206
0 references
