"Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow."

Thomas Erlebach (2006)

> Home

Details and statistics

DOI: 10.1007/11671541_4

access: closed

type: Part in Book or Collection

metadata version: 2017-05-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - series/lncs/Erlebach06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/lncs/Erlebach06
Thomas Erlebach:
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow. Efficient Approximation and Online Algorithms 2006: 97-134

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.