Using a geometric lens to find k disjoint shortest paths

Matthias Bentert, André Nichterlein, Malte Renken +1

Given an undirected $n$-vertex graph and $k$ pairs of terminal vertices $(s_1,t_1),\dots ,(s_k,t_k)$, the $k$-Disjoint Shortest Paths ($k$-DSP)-problem asks whether there are $k$…