Multicommodity Flow, Well-linked Terminals and Routing Problems
Publisher
Springer New York
Reference18 articles.
1. Andrews M, Chuzhoy J, Khanna S, Zhang L (2005) Hardness of the undirected edge-disjoint paths problem with congestion. In: Proceedings of the IEEE FOCS, pp 226–244
2. Azar Y, Regev O (2006) Combinatorial algorithms for the unsplittablae flow problem. Algorithmica 44(1):49–66, Preliminary version in Proceedings of the IPCO 2001
3. Chekuri C, Khanna S, Shepherd FB (2004) Edge-disjoint paths in Planar graphs. In: Proceedings of the IEEE FOCS, pp 71–80
4. Chekuri C, Khanna S, Shepherd FB (2004) The all-or-nothing multicommodity flow problem. In: Proceedings of the ACM STOC, pp 156–165
5. Chekuri C, Khanna S, Shepherd FB (2005) Multicommodity flow, well-linked terminals, and routing problems. In: Proceedings of the ACM STOC, pp 183–192