Improved Runtimes and Lower Bounds for Dual-Edge Failure Replacement Path Algorithms
Name
Woldeghebriel-eyobw-meng-eecs-2021-thesis.pdf
Description
Thesis PDF
Size
328.78 KB
Format
Adobe PDF
Checksum (MD5)
6a188f16075a601ea8a41ddcdb81ac7a
Author(s)
Woldeghebriel, Eyob W.
Advisor(s)
Williams, Virginia Vassilevska
Date Issued
June 2021
Publisher
Massachusetts Institute of Technology
Abstract
Given a graph G and a fixed pair of nodes s and t, the Replacement Paths problem is to compute the new shortest distance from s to t when there are edge failures in G (i.e. those edges can no longer be used for any path). While there has been extensive research into the single-failure Replacement Paths problem, less progress has been made on multiple-failure algorithms. This thesis provides a new algorithm for the two-failure variant of the Replacement Paths problem, and shows a new combinatorial lower bound for the runtime of k-failure Replacement Paths for any positive integer k.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright MIT
Persistent DSpace Link
