STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Mathematics of Operations Research
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved bounds for the unsplittable flow problem
Journal of Algorithms
ACM Transactions on Algorithms (TALG)
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Disjoint paths in sparse graphs
Discrete Applied Mathematics
A nature-inspired algorithm for the disjoint paths problem
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Greedy approximation via duality for packing, combinatorial auctions and routing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.89 |
In a recent paper Chekuri and Khanna improved the analysis of the greedy algorithm for the edge disjoint paths problem and proved the same bounds also for the related uniform capacity unsplittable flow problem. Here we show that their ideas can be used to get the same approximation ratio even for the more general Unsplittable Flow Problem with nonuniform edge capacities.