I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
I/O-efficient undirected shortest paths with unbounded edge lengths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Characterizing the performance of flash memory storage devices and its impact on algorithm design
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
On Computational Models for Flash Memory Devices
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
A Heuristic Strong Connectivity Algorithm for Large Graphs
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Online Paging for Flash Memory Devices
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Graph indexing of road networks for shortest path queries with label restrictions
Proceedings of the VLDB Endowment
ESA'11 Proceedings of the 19th European conference on Algorithms
Efficient data management in support of shortest-path computation
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Real-time routing with OpenStreetMap data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Distributed time-dependent contraction hierarchies
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Efficient route compression for hybrid route planning
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Optimizing Landmark-Based Routing and Preprocessing
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
| Hi-index | 0.00 |
We provide an implementation of an exact route planning algorithm on a mobile device that answers shortest-path queries in a road network of a whole continent instantaneously, i.e., with a delay of about 100 ms which is virtually not observable for a human user. Our main algorithmic contribution of is a highly compressed blocked representation of the underlying hierarchical graph and a new fast yet compact route reconstruction data structure. Our representation exploits the locality properties of the graph using a very simple algorithm that does not use any a priori information.