Low Sensitivity Hopsets

Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng +2

Given a weighted graph $G$, a $(\beta ,\epsilon )$-hopset $H$ is an edge set such that for any $s,t\in V(G)$, where $s$ can reach $t$ in $G$, there is a path from $s$ to $t$ in $G \c…