Space-efficient SHARC-routing

  • Authors:

  • Edith Brunel;Daniel Delling;Andreas Gemsa;Dorothea Wagner

  • Affiliations:

  • Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany;Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany;Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany;Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany

  • Venue:
  • SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Accelerating the computation of quickest paths in road networks has been undergoing a rapid development during the last years. The breakthrough idea for handling road networks with tens of millions of nodes was the concept of shortcuts, i.e., additional arcs that represent long paths in the input. Very recently, this concept has been transferred to time-dependent road networks where travel times on arcs are given by functions. Unfortunately, the concept of shortcuts is very space-consuming in time-dependent road networks since the travel time functions assigned to the shortcuts may become quite complex. In this work, we present how the space overhead induced by time-dependent SHARC, a technique relying on shortcuts as well, can be reduced significantly. We are able to reduce the overhead stemming from SHARC by a factor of up to 11.5 for the price of a loss in query performance of a factor of 4. The methods we present allow a trade-off between space consumption and query performance.