Goal Directed Shortest Path Queries Using Precomputed Cluster Distances (CROSBI ID 533423)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Maue, Jens ; Sanders, Peter ; Matijević, Domagoj
engleski
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
We demonstrate how Dijkstra's algorithm for shortest path queries can be accelerated by using precomputed shortest path distances. Our approach allows a completely flexible tradeoff between query time and space consumption for precomputed distances. In particular, sublinear space is sufficient to give the search a strong ``sense of direction''. We evaluate our approach experimentally using large, real-world road networks.
shortest paths
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
316-327-x.
2006.
objavljeno
Podaci o matičnoj publikaciji
Alvarez, Carme ; Serna, Maria J.
Berlin: Springer
3-540-34597-3
Podaci o skupu
5th International Workshop on Experimetal Algorithms (WEA 2006),
predavanje
24.05.2006-27.05.2006
Menorca, Španjolska