The quickest multicommodity flow problem

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

Volumn 2337 LNCS, Issue , 2002, Pages 36-53

  Fleischer, Lisa ^a   Skutella, Martin ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; ALGORITHMS; POLYNOMIAL APPROXIMATION;

ARBITRARY PRECISION; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; MULTI-COMMODITY FLOW; MULTICOMMODITY FLOW PROBLEMS; POLYNOMIAL SIZE; POLYNOMIAL-TIME; SIMPLE STRUCTURES; TIME-EXPANDED NETWORKS; DISCRETIZATIONS;

POLYNOMIAL APPROXIMATION; POLYNOMIALS;

EID: 84868666471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_4     Document Type: Conference Paper

References (19)

1. J. E. Aronson. A survey of dynamic network flows. Annals of Operations Research, 20:1-66, 1989.
2. R. E. Burkard, K. Dlaska, and B. Klinz. The quickest flow problem. ZOR -Methods and Models of Operations Research, 37:31-58, 1993.
3. L. K. Fleischer. Approximating fractional multicommodity flows independent of the number of commodities. SIAM Journal on Discrete Mathematics, 13:505-520, 2000.
4. L. K. Fleischer and É Tardos. Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23:71-80, 1998.
5. L. R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419-433, 1958.
6. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
7. D. Gale. Transient flows in networks. Michigan Mathematical Journal, 6:59-63, 1959.
8. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300-309, Palo Alto, CA, 1998.
9. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Berlin, 1988.
10. G. Handler and I. Zang. A dual algorithm for the constrained shortest path problem. Networks, 10:293-310, 1980.
11. R. Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17:36-42, 1992.
12. B. Hoppe and É Tardos. Polynomial time algorithms for some evacuation problems. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 433-441, Arlington, VA, 1994.
13. B. Hoppe and É Tardos. The quickest transshipment problem. Mathematics of Operations Research, 25:36-62, 2000.
14. B. Klinz and G. J. Woeginger. Minimum cost dynamic flows: The series-parallel case. In E. Balas and J. Clausen, editors, Integer Programming and Combinatorial Optimization, volume 920 of Lecture Notes in Computer Science, pages 329-343. Springer, Berlin, 1995.
15. D. H. Lorenz and D. Raz. A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters, 28:213-219, 2001.
16. E. Minieka. Maximal, lexicographic, and dynamic network flows. Operations Research, 21:517-527, 1973.
17. C. A. Phillips. The network inhibition problem. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pages 776-785, San Diego, CA, 1993.
18. W. B. Powell, P. Jaillet, and A. Odoni. Stochastic and dynamic networks and routing. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Routing, volume 8 of Handbooks in Operations Research and Management Science, chapter 3, pages 141-295. North-Holland, Amsterdam, The Netherlands, 1995.
19. W. L. Wilkinson. An algorithm for universal maximal dynamic flows in a network. Operations Research, 19:1602-1612, 1971.