Given a graph G = (V,E) and k source-sink pairs {(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks to find k disjoint paths connecting all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks for k disjoint paths connecting all the sourcesink pairs with minimized length of the longest path. We show that the wei...