European Symposium on Algorithms

ESA 2014: Algorithms - ESA 2014 pp 358-370

GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem

  • Alexandros Efentakis
  • Dieter Pfoser
Conference paper

DOI: 10.1007/978-3-662-44777-2_30

Volume 8737 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Efentakis A., Pfoser D. (2014) GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem. In: Schulz A.S., Wagner D. (eds) Algorithms - ESA 2014. ESA 2014. Lecture Notes in Computer Science, vol 8737. Springer, Berlin, Heidelberg

Abstract

Many existing solutions focus on point-to-point shortest-path queries in road networks. In contrast, only few contributions address the related single-source shortest-path problem, i.e., finding shortest-path distances from a single source s to all other graph vertices. This work extends graph separator methods to handle this specific problem and its one-to-many variant, i.e., calculating the shortest path distances from a single source to a set of targets T ⊆ V. This novel family of so-called GRASP algorithms provides exceptional preprocessing times, making them suitable for dynamic travel time scenarios. GRASP algorithms also efficiently solve range / isochrone queries not handled by previous approaches.

Keywords

Shortest-path computation GRASP algorithm Range queries Isochrones 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Alexandros Efentakis
    • 1
  • Dieter Pfoser
    • 2
  1. 1.Research Center “Athena”Greece
  2. 2.Department of Geography and GeoInformation ScienceGeorge Mason UniversityUSA