Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure

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 these edges fai...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings / annual Symposium on Foundations of Computer Science S. 907 - 918
Hauptverfasser:	Williams, Virginia Vassilevska, Woldeghebriel, Eyob, Xu, Yinzhan
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.10.2022
Schlagworte:	Complexity theory Computer science Data structures Directed graphs Fault tolerance Fault tolerant systems fine-grained complexity Replacement paths Shortest path problem
ISSN:	2575-8454
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!