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. Combinatorica, 30(5):485-520, 2010. [doi]

@article{AndrewsCGKTZ10,
  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 = {2010},
  doi = {10.1007/s00493-010-2455-9},
  url = {http://dx.doi.org/10.1007/s00493-010-2455-9},
  tags = {graph-rewriting, rewriting, routing},
  researchr = {https://researchr.org/publication/AndrewsCGKTZ10},
  cites = {0},
  citedby = {0},
  journal = {Combinatorica},
  volume = {30},
  number = {5},
  pages = {485-520},
}