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

  • Ittai Abraham
  • Daniel Delling
  • Andrew V. Goldberg
  • Renato F. Werneck
Conference paper

DOI: 10.1007/978-3-642-20662-7_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6630)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ittai Abraham
    • 1
  • Daniel Delling
    • 1
  • Andrew V. Goldberg
    • 1
  • Renato F. Werneck
    • 1
  1. 1.Microsoft Research Silicon ValleyUSA

Personalised recommendations