"Inapproximability of Edge-Disjoint Paths and low congestion routing on ..."

Matthew Andrews et al. (2010)

> Home

Details and statistics

DOI: 10.1007/S00493-010-2455-9

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/AndrewsCGKTZ10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/AndrewsCGKTZ10
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang:
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. Comb. 30(5): 485-520 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.