Experimental evaluation of approximation algorithms for single-source unsplittable flow

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

Volumn 1610, Issue , 1999, Pages 328-344

  Kolliopoulos, Stavros G ^a   Stein, Clifford ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COST ACCOUNTING; INTEGER PROGRAMMING;

ARBITRARY GRAPHS; EDGE CAPACITY; EXPERIMENTAL EVALUATION; MINIMUM COST FLOWS; SINGLE SOURCE; THEORETICAL GUARANTEES; UNSPLITTABLE FLOW; UNSPLITTABLE FLOW PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 0009744441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_25     Document Type: Conference Paper

References (34)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
2. Tamas Badics. GENRMF. ftp://dimacs.rutgers.edu/pub/netflow/generators/- network/ genrmf/, 1991.
3. C. Chekuri, A. V. Goldberg, D. Karger, M. Levine, and C. Stein. Experimental study of minimum cut algorithms. In Proc. of 8th SODA, 324-333, 1997.
4. B. V. Cherkassky and A. V. Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of 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. M. Deng, D. F. Lynch, S. J. Phillips, and J. R. Westbrook. Algorithms for restoration planning in a telecommunications network. In ALENEX99, 1999.
7. Y. Dinitz, N. Garg, and M. Goemans. On the single-source unsplittable flow problem. In Proc. of 39th FOCS, 290-299, November 1998.
8. P. Elias, A. Feinstein, and C. E. Shannon. Note on maximum flow through a network. IRE Transactions on Information Theory IT-2, 117-199, 1956.
9. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canad. J. Math., 8:399-404, 1956.
10. A. Frank. Packing paths, cuts and circuits - a survey. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, editors, Paths, Flows and VLSI-Layout, 49-100. Springer-Verlag, Berlin, 1990.
11. N. Garg, V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18:3-20, 1997.
12. A. V. Goldberg, J. D. Oldham, S. A. Plotkin, and C. Stein. An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow. In Proc. of the 6th Conference on Integer Programming and Combinatorial Optimization, 338-352, 1998. Published as Lecture Notes in Computer Science 1412, Springer-Verlag.
13. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921-940, 1988.
14. A.V. Goldberg and S. Rao. Beyond the flow decomposition barrier. In Proc. of the 38th Annual Symposium on Foundations of Computer Science, 2-11, 1997.
15. 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.
16. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM, 34:144- 162, 1987.
17. P. Klein, A. Agrawal, R. Ravi, and S. Rao. Approximation through multicommodity flow. In Proc. of the 31st Annual Symposium on Foundations of Computer Science, 726-737, 1990.
18. P. Klein, S. A. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 23(3):466-487, June 1994.
19. J. M. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA, May 1996.
20. J. M. Kleinberg. Single-source unsplittable flow. In Proc. of the 37th Annual Symposium on Foundations of Computer Science, 68-77, October 1996.
21. J. M. Kleinberg and E. Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. In Proc. of the 27th Annual ACM Symposium on Theory of Computing, 26-35, 1995.
22. J. M. Kleinberg and E. Tardos. Disjoint paths in densely-embedded graphs. In Proc. of the 36th Annual Symposium on Foundations of Computer Science, 52-61, 1995.
23. S. G. Kolliopoulos. Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems. PhD thesis, Dartmouth College, Hanover, NH, August 1998.
24. S. G. Kolliopoulos and C. Stein. Improved approximation algorithms for unsplittable flow problems. In Proc. of the 38th Annual Symposium on Foundations of Computer Science, 426-435, 1997.
25. T. Leighton, F. Makedon, S. Plotkin, C. Stein, É. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50:228-243, 1995.
26. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. of the 29th Annual Symposium on Foundations of Computer Science, 422- 431, 1988.
27. J. K. Lenstra, D. B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990.
28. T. Leong, P. Shor, and C. Stein. Implementation of a combinatorial multicommodity flow algorithm. In D. S. Johnson and C. C. McGeoch, editors, DIMACS Series in Discrete Mathematics and, Theoretical Computer Science: Volume 12, Network Flows and, Matching. October 1991.
29. Hiroshi Nagamochi, Tadashi Ono, and Toshihde Ibaraki. Implementing an efficient minimum capacity cut algorithm. Mathematical Programming, 67:325-241, 1994.
30. CPLEX Optimization, Inc. Using the CPLEX callable library. Software Manual, 1995.
31. P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
32. N. Robertson and P. D. Seymour. Outline of a disjoint paths algorithm. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, editors, Paths, Flows and, VLSI-Layout. Springer-Verlag, Berlin, 1990.
33. A. Schrijver. Homotopic routing methods. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, editors, Paths, Flows and, VLSI-Layout. Springer-Verlag, Berlin, 1990.
34. F. Shahrokhi and D. W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37:318 - 334, 1990.