Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms and Data Structures: The Basic Toolbox
Algorithms and Data Structures: The Basic Toolbox
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Robust and Online Large-Scale Optimization
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Algorithmica - Special Issue: European Symposium on Algorithms
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Alternative routes in road networks
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
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
Time-dependent contraction hierarchies and approximation
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Partitioning graphs to speed up dijkstra's algorithm
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Candidate sets for alternative routes in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Time-dependent route planning with generalized objective functions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Hi-index | 0.00 |
We describe an algorithmic framework for lossless compression of route descriptions. This is useful for hybrid route planning where routes are computed by a server and then transmitted to a client device in a car using some mobile radio communication where bandwidth may be low. Compressed routes are represented by only a few via nodes which are the connection points when the route is decomposed into unique optimal segments. To reconstruct the route efficiently a client device needs basic but fast route planning capability. Contraction hierarchies make this approach fast enough for practice: Compressing takes only a few milliseconds. And previous experiments suggest that a client can decompress each route segment virtually instantaneously. So, as the segments can be decompressed successively while driving, it is not likely that the driver experiences any delay except for the time needed by the mobile communication.