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]
@article{AndrewsCGKTZ07,
title = {Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs},
author = {Matthew Andrews and Julia Chuzhoy and Venkatesan Guruswami and Sanjeev Khanna and Kunal Talwar and Lisa Zhang},
year = {2007},
url = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-113/index.html},
tags = {graph-rewriting, rewriting, routing},
researchr = {https://researchr.org/publication/AndrewsCGKTZ07},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {14},
number = {113},
}