Shortest-path queries in static networks
Author:
Top Cited Papers
Open Access
- 1 March 2014
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 46 (4) , 1-31
Abstract
We consider the point-to-point (approximate) shortest-path query problem , which is the following generalization of the classical single-source (SSSP) and all-pairs shortest-path (APSP) problems: we are first presented with a network (graph) . A so-called preprocessing algorithm may compute certain information (a data structure or index) to prepare for the next phase. After this preprocessing step, applications may ask shortest-path or distance queries, which should be answered as fast as possible. Due to its many applications in areas such as transportation, networking, and social science, this problem has been considered by researchers from various communities (sometimes under different names): algorithm engineers construct fast route planning methods; database and information systems researchers investigate materialization tradeoffs , query processing on spatial networks , and reachability queries ; and theoretical computer scientists analyze distance oracles and sparse spanners . Related problems are considered for compact routing and distance labeling schemes in networking and distributed computing and for metric embeddings in geometry as well. In this survey, we review selected approaches, algorithms, and results on shortest-path queries from these fields, with the main focus lying on the tradeoff between the index size and the query time. We survey methods for general graphs as well as specialized methods for restricted graph classes, in particular for those classes with arguable practical significance such as planar graphs and complex networks.Keywords
This publication has 165 references indexed in Scilit:
- Many Distances in Planar GraphsAlgorithmica, 2010
- Clustering spatial networks for aggregate query processing: A hypergraph approachInformation Systems, 2008
- Distance labeling in graphsJournal of Algorithms, 2004
- Compact and localized distributed data structuresDistributed Computing, 2003
- Scientific collaboration networks. II. Shortest paths, weighted networks, and centralityPhysical Review E, 2001
- Faster Shortest-Path Algorithms for Planar GraphsJournal of Computer and System Sciences, 1997
- Shortest paths in euclidean graphsAlgorithmica, 1986
- A separator theorem for graphs of bounded genusJournal of Algorithms, 1984
- Reoptimization procedures in shortest path problemDecisions in Economics and Finance, 1980
- A note on two problems in connexion with graphsNumerische Mathematik, 1959