5 papers:
ICALP-v1-2014-HohnMW #cost analysis #how #scheduling- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions (WH, JM, AW), pp. 625–636.
STOC-2006-BansalCES #graph- A quasi-PTAS for unsplittable flow on line graphs (NB, AC, AE, BS), pp. 721–729.
- STOC-2005-AwerbuchAE #scalability
- Large the price of routing unsplittable flow (BA, YA, AE), pp. 57–66.
- ICALP-2004-FotakisKS
- Selfish Unsplittable Flows (DF, SCK, PGS), pp. 593–605.
- STOC-1998-Kleinberg #algorithm #problem
- Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem (JMK), pp. 530–539.
