The following publications are possibly variants of this publication:
- Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphsMatthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang. combinatorica, 30(5):485-520, 2010. [doi]
- Hardness of the Undirected Edge-Disjoint Paths Problem with CongestionMatthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang. focs 2005: 226-244 [doi]
- Routing in undirected graphs with constant congestionJulia Chuzhoy. stoc 2012: 855-874 [doi]
- Routing in Undirected Graphs with Constant CongestionJulia Chuzhoy. SICOMP, 45(4):1490-1532, 2016. [doi]
- Edge-Disjoint Paths in Planar Graphs with Constant CongestionChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. SICOMP, 39(1):281-301, 2009. [doi]
- Edge-disjoint paths in Planar graphs with constant congestionChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. stoc 2006: 757-766 [doi]