Approximating the single source unsplittable min-cost flow problem

Mathematical Programming, Series B

Volumn 91, Issue 3, 2002, Pages 493-514

  Skutella, Martin ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithm; Multi commodity flow; Network flow; Routing; Unsplittable flow

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; MULTI COMMODITY FLOW; NETWORK FLOW; ROUTING; UNSPLITTABLE FLOW;

COMPUTATIONAL METHODS;

EID: 3543074358     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100260     Document Type: Article

References (12)

1. Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E. (1992): Finding minimum-cost flows by double scaling. Mathematical Programming 53, 243-266
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B. (1993): Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, New Jersey
3. Asano, Y. (2000): Experimental evaluation of approximation algorithms for the minimum cost multiple-source unsplittable flow problem. Proceedings of the Workshop on Approximation and Randomized Algorithms in Communication Networks, Carleton Scientific Press, 111-122
4. Dinitz, Y., Garg, N., Goemans, M.X. (1999): On the single source unsplittable flow problem. Combinatorica 19, 1-25
5. Goldberg, A.V., Tarjan, R.E. (1990): Solving minimum cost flow problems by successive approximation. Mathematics of Operations Research 15, 430-466
6. Kleinberg, J.M. (1996): Approximation algorithms for disjoint paths problems. Ph.D. thesis, M.I.T.
7. Kleinberg, J.M. (1996): Single-source unsplittable flow. Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 68-77
8. Kolliopoulos, S.G. (1998): Exact and approximation algorithms for network flow and disjoint-path problems. Ph.D. thesis, Dartmouth College
9. Kolliopoulos, S.G., Stein, C. (2001): Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing, to appear
10. Lenstra, J.K., Shmoys, D.B., Tardos, E. (1990): Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46, 259-271
11. Orlin, J.B. (1993): A faster strongly polynomial minimum cost flow algorithm. Operations Research 41, 338-350
12. Shmoys, D.B., Tardos, E. (1993): An approximation algorithm for the generalized assignment problem. Mathematical Programming 62, 461-474