Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs

Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Electronic Colloquium on Computational Complexity (ECCC), 14(113), 2007. [doi]

Abstract

Abstract is missing.