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

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 907 - 918
Main Authors:	Williams, Virginia Vassilevska, Woldeghebriel, Eyob, Xu, Yinzhan
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!