Implementing approximation algorithms for the single-source unsplittable flow problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3059, Issue , 2004, Pages 213-227

  Du, Jingde ^a   Kolliopoulos, Stavros G ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FLOW GRAPHS;

BI-CRITERIA; COMMON SOURCE; COST VALUES; EDGE CAPACITY; FLOWTHROUGH; SINGLE PATH; SINGLE SOURCE; UNSPLITTABLE FLOW PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 35048865412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_16     Document Type: Article

References (19)

1. R.K. Ahuja, A.V. Goldberg, J.B. Orlin, and R.E. Tarjan. Finding minimum-cost flows by double scaling. Mathematical Programming 53, 243-266, 1992.
2. T. Badics. GENRMF ftp://dimacs.rutgers.edu/pub/netflow/generators/ network/genrmf/, 1991.
3. C. Chekuri, A.V. Goldberg, D. Karger, M. Levine, and G. Stein. Experimental - study of minimum cut algorithms. In Proc. 8th ACM-SIAM SODA, 324-333, 1997.
4. B.V. Cherkassky and A.V. Goldberg. An efficient implementation of a minimum-cost flow algorithm. J. Algorithms, 22:1-29, 1997.
5. B.V. Cherkassky and A.V. Goldberg. On implementing the push-relabel method for the maximum flow problem. Algorithmica, 19:390-410, 1997.
6. Y. Dinitz, N. Garg, and M.X. Goemans. On the single-source unsplittable flow problem. Combinatorica, 19:1-25, 1999.
7. T. Erlebach and A. Hall. NP-hardness of broadcast sheduling and inapproximability of single-source unsplittable min-cost flow. Proc. 13th ACM-SIAM SODA, 2002, 194-202.
8. A.V. Goldberg and S. Rao. Beyond the flow decomposition barrier. J. ACM, 45:783-797, 1998.
9. A.V. Goldberg and R.E. Tarjan. Solving minimum cost flow problems by successive approximation. Mathematics of Operations Research 15, 430-466, 1990.
10. A.V. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem. J. ACM, Vol. 35, No. 4, pages 921-940, October 1988.
11. D. Goldfarb and M. Grigoriadis. A computational comparison of the Dinic and Network Simplex methods for maximum flow. Annals of Operations Research, 13:83-123, 1988.
12. J.M. Kleinberg. Approximation algorithms for disjoint paths problems. Ph.D. thesis, MIT, Cambridge, MA, May 1996.
13. J.M. Kleinberg. Single-source unsplittable flow. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 68-77, October 1996.
14. S.G. Kolliopoulos and C. Stein. Approximation algorithms for single-source unsplittable flow. SIAM J. Computing, 31(3): 919-946, 2002.
15. S.G. Kolliopoulos and C. Stein. Experimental evaluation of approximation algorithms for single-source unsplittable flow. Proc. 7th IPCO, Springer-Verlag LNCS vol. 1610, 153-168, 1999.
16. J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46, 259-271, 1990.
17. Hiroshi Nagamochi, Tadashi Ono, and Toshihide Ibaraki. Implementing an efficient minimum capacity cut algorithm. Mathematical Programming, 67:325-241, 1994.
18. J.B. Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations Research 41, 338-350, 1993.
19. M. Skutella. Approximating the single source unsplittable min-cost flow problem. Mathematical Programming, Ser. B 91(3), 493-514, 2002.