The k-splittable flow problem

Algorithmica (New York)

Volumn 42, Issue 3-4, 2005, Pages 231-248

  Baier, Georg ^a   Köhler, Ekkehard ^a   Skutella, Martin ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Approximation algorithm; Max flow min cut; Network flow; Unsplittable flow

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; GRAPH THEORY; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

APPROXIMATION ALGORITHMS; MAX-FLOW MIN-CUT; NETWORK FLOW; UNSPLITTABLE FLOW;

ALGORITHMS;

EID: 22344451292     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1167-9     Document Type: Conference Paper

References (18)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, On-line routing of virtual circuits with applications to load balancing and machine scheduling, Journal of the Association for Computing Machinery, 44 (1997), 486-504.
3. Y. Azar and O. Regev, Strongly polynomial algorithms for the unsplittable flow problem, in Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, 2001, pp. 15-29.
4. A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, Algorithms for fault-tolerant routing in circuit switched networks, in Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, 2002, pp. 265-274.
5. A. Baveja and A. Srinivasan, Approximation algorithms for disjoint paths and related routing and packing problems, Mathematics of Operations Research, 25 (2000), 255-280.
6. Y. Dinitz, N. Garg, and M. X. Goemans, On the single-source unsplittable flow problem., Combinatorica, 19 (1999), 17-41.
7. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 19-28.
8. J. Kleinberg, Approximation Algorithms for Disjoint Paths Problems, Ph.D. thesis, MIT, 1996.
9. J. Kleinberg, Single-source unsplittable flow, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 68-77.
10. J. Kleinberg and R. Rubinfeld, Short paths in expander graphs, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 86-95.
11. J. Kleinberg and E. Tardos, Disjoint paths in densely embedded graphs, in Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 52-61.
12. S. G. Kolliopoulos, Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems, Ph.D. thesis, Dartmouth College, 1998.
13. S. G. Kolliopoulos and C. Stein, Improved approximation algorithms for unsplittable flow problems, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, pp. 426-435.
14. S. G. Kolliopoulos and C. Stein, Approximating disjoint-path problems using greedy algorithms and packing integer programs, in Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization, 1998, pp. 153-168.
15. P. Kolman and C. Scheideler, Improved bounds for the unsplittable flow problem, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 184-193.
16. P. Krysta, P. Sanders, and B. Vöcking, Scheduling and traffic allocation for tasks with bounded splittability, in Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, 2003, pp. 500-510.
17. P. Raghavan and C. Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), 365-374.
18. M. Skutella, Approximating the single-source unsplittable min-cost flow problem, Mathematical Programming, 91 (2002), 493-514.