"Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees."

Khaled M. Elbassioni et al. (2012)

> Home

Details and statistics

DOI: 10.4230/LIPICS.FSTTCS.2012.267

access: open

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fsttcs/ElbassioniGGKN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/ElbassioniGGKN12
Khaled M. Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, Arindam Pal:
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. FSTTCS 2012: 267-275

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.