{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/139098"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/139098","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Improved Runtimes and Lower Bounds for Dual-Edge Failure Replacement Path Algorithms","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Woldeghebriel, Eyob W."],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Williams, Virginia Vassilevska"],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-06","date_published":"2021-06","updated_at":"2026-07-22T22:21:10Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/139098","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Williams, Virginia Vassilevska"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Woldeghebriel, Eyob W."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-01-14T14:49:45Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-01-14T14:49:45Z"]},{"key":"dc:date.issued","label":"Date","values":["2021-06"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/139098"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Improved Runtimes and Lower Bounds for Dual-Edge Failure Replacement Path Algorithms"]}]}],"canonical_facts":{"dc:contributor.advisor":["Williams, Virginia Vassilevska"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Woldeghebriel, Eyob W."],"dc:date.accessioned":["2022-01-14T14:49:45Z"],"dc:date.available":["2022-01-14T14:49:45Z"],"dc:date.issued":["2021-06"],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/139098"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Improved Runtimes and Lower Bounds for Dual-Edge Failure Replacement Path Algorithms"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:21:10Z"}