Abstract
We propose a conceptually simple, yet very effective extension of the highly popular Contraction Hierarchies (CH) speedup technique improving query times for shortest paths in road networks by one order of magnitude with very modest space overhead. Using our scheme we are able to answer queries on continental-sized road networks with more than half a billion edges in the microseconds range on standard workstation hardware. Previous approaches that are considerably faster than CH were only for shortest path distance queries (recovering the actual path required additional effort and space) or suffered from humongous space consumption hindering their practicality for large real-world road networks. Our approach can be interpreted as a seamless interpolation between Contraction Hierarchies and Hub Labels.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
