A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
- Cite this paper as:
- Abraham I., Delling D., Goldberg A.V., Werneck R.F. (2011) A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In: Pardalos P.M., Rebennack S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg
Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical point-to-point shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While no practical implementation of this algorithm existed, it has the best time bounds. This paper describes an implementation of the labeling algorithm that is faster than any existing method on continental road networks.
Unable to display preview. Download preview PDF.