Chapter

Experimental Algorithms

Volume 6630 of the series Lecture Notes in Computer Science pp 230-241

A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks

  • Ittai AbrahamAffiliated withLancaster UniversityMicrosoft Research Silicon Valley
  • , Daniel DellingAffiliated withLancaster UniversityMicrosoft Research Silicon Valley
  • , Andrew V. GoldbergAffiliated withLancaster UniversityMicrosoft Research Silicon Valley
  • , Renato F. WerneckAffiliated withLancaster UniversityMicrosoft Research Silicon Valley

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.