17 search results - page 1 / 4 » In Transit to Constant Time Shortest-Path Queries in Road Ne... |
ALENEX
2007
13 years 6 months ago
2007
EDBT
2008
ACM
14 years 4 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
WEA
2007
Springer
13 years 11 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...