The Shortcut Problem - Complexity and Approximation

During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road networks. The most sophisticated methods enhance the graph by inserting shortcuts, i.e. additional edges, that represent shortest paths in the graph. Until now, all existing shortcut-insertion strategies are heuristics and no theoretical results on the topic are known. In this work, we formalize the problem of adding shortcuts as a graph augmentation problem, study the algorithmic complexity of the problem, give approximation algorithms and show how to stochastically evaluate a given shortcut assignment on graphs that are too big to evaluate it exactly.

• Type: Conference
• Year: 2009
• Where: SOFSEM
• Authors: Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner
• Keywords: Graph Augmentation Problem, Huge Road Networks, Shortest Paths, SOFSEM 2009, Theoretical Computer Science