<?xml version="1.0"?>
<dblp>
<article key="journals/eccc/AndrewsCGKTZ07" publtype="informal publication" mdate="2011-12-07">
<author>Matthew Andrews</author>
<author>Julia Chuzhoy</author>
<author>Venkatesan Guruswami</author>
<author>Sanjeev Khanna</author>
<author>Kunal Talwar</author>
<author>Lisa Zhang</author>
<title>Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.</title>
<year>2007</year>
<volume>14</volume>
<journal>Electronic Colloquium on Computational Complexity (ECCC)</journal>
<ee>http://eccc.hpi-web.de/eccc-reports/2007/TR07-113/index.html</ee>
<number>113</number>
<url>db/journals/eccc/eccc14.html#AndrewsCGKTZ07</url>
</article>
</dblp>
