The Shortcut Problem - Complexity and Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Graph Algorithms and Applications Year : 2012

The Shortcut Problem - Complexity and Algorithms


We study a graph-augmentation problem arising from a technique applied in recent approaches for route planning. Many such methods enhance the graph by inserting shortcuts, i.e., additional edges (u,v) such that the length of (u,v) is the distance from u to v. Given a weighted, directed graph G and a number c in Z, the shortcut problem asks how to insert c shortcuts into G such that the expected number of edges that are contained in an edge-minimal shortest path from a random node s to a random node t is minimal. In this work, we study the algorithmic complexity of the problem and give approximation algorithms for a special graph class. Further, we state ILP-based exact approaches and show how to stochastically evaluate a given shortcut assignment on graphs that are too large to do so exactly.
Fichier principal
Vignette du fichier
02-IJGAA.pdf (310.29 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00728877 , version 1 (06-09-2012)



Reinhard Bauer, Gianlorenzo d'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner. The Shortcut Problem - Complexity and Algorithms. Journal of Graph Algorithms and Applications, 2012, 16 (2), ⟨10.7155/jgaa.00270⟩. ⟨hal-00728877⟩
378 View
454 Download



Gmail Mastodon Facebook X LinkedIn More