Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
- Cite this paper as:
- Wagner D., Willhalm T. (2003) Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In: Di Battista G., Zwick U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg
In this paper, we consider Dijkstra’s algorithm for the single source single target shortest paths problem in large sparse graphs. The goal is to reduce the response time for online queries by using precomputed information. For the result of the preprocessing, we admit at most linear space. We assume that a layout of the graph is given. From this layout, in the preprocessing, we determine for each edge a geometric object containing all nodes that can be reached on a shortest path starting with that edge. Based on these geometric objects, the search space for online computation can be reduced significantly. We present an extensive experimental study comparing the impact of different types of objects. The test data we use are traffic networks, the typical field of application for this scenario.
Unable to display preview. Download preview PDF.