Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures

This paper considers a natural fault-tolerant shortest paths problem: for some constant integer $f$, given a directed weighted graph with no negative cycles and two fixed vertices $s$ and $t$, compute (either explicitly or implicitly) for every tuple of $f$ edges, the distance from $s$ to $t$ if the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Williams, Virginia Vassilevska, Woldeghebriel, Eyob, Xu, Yinzhan
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!