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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 907 - 918
Hlavní autori:	Williams, Virginia Vassilevska, Woldeghebriel, Eyob, Xu, Yinzhan
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2022
Predmet:	Complexity theory Computer science Data structures Directed graphs Fault tolerance Fault tolerant systems fine-grained complexity Replacement paths Shortest path problem
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!