Faster Algorithms for Dual-Failure Replacement Paths

Shiri Chechik, Tianyi Zhang

Given a simple weighted directed graph $G=(V,E,\omega )$ on $n$ vertices as well as two designated terminals $s,t\in V$, our goal is to compute the shortest path from $s$ to $t$ avo…