Multicommodity flows over time: Efficient algorithms and complexity

Theoretical Computer Science

Volumn 379, Issue 3, 2007, Pages 387-404

  Hall, Alex ^a   Hippler, Steffen ^b   Skutella, Martin ^c  

^a ETH ZURICH   (Switzerland)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Complexity; Dynamic flow; Efficient algorithm; Flow over time; Network flow; Routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; DATA FLOW ANALYSIS; NETWORK ROUTING; PROBLEM SOLVING;

DYNAMIC FLOW; EFFICIENT ALGORITHMS; FLOW OVER TIME; MULTICOMMODITY FLOWS; NETWORK FLOW;

LARGE SCALE SYSTEMS;

EID: 34248561760     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.046     Document Type: Article

References (18)

1. Aronson J.E. A survey of dynamic network flows. Annals of Operations Research 20 (1989) 1-66
2. Burkard R.E., Dlaska K., and Klinz B. The quickest flow problem. ZOR - Methods and Models of Operations Research 37 (1993) 31-58
3. Erlebach T., and Jansen K. Call scheduling in trees, rings and meshes. Proceedings of the 30th Hawaii International Conference on System Sciences (1997), IEEE Computer Society Press 221-222
4. L. Fleischer, M. Skutella, Quickest flows over time, SIAM Journal on Computing 36 (6) 1600-1630
5. Fleischer L., and Skutella M. The quickest multicommodity flow problem. In: Cook W.J., and Schulz A.S. (Eds). Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science vol. 2337 (2002), Springer, Berlin 36-53
6. Fleischer L., and Skutella M. Minimum cost flows over time without intermediate storage. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003), Baltimore, MD 66-75
7. Fleischer L.K., and Tardos É. Efficient continuous-time dynamic network flow algorithms. Operations Research Letters 23 (1998) 71-80
8. Ford L.R., and Fulkerson D.R. Constructing maximal dynamic flows from static flows. Operations Research 6 (1958) 419-433
9. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton, NJ
10. Gale D. Transient flows in networks. Michigan Mathematical Journal 6 (1959) 59-63
11. Gallo G., Grigoriadis M.D., and Tarjan R.E. A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing 18 (1989) 30-55
12. Hall A., Hippler S., and Skutella M. Multicommodity flows over time: Efficient algorithms and complexity. In: Baeten J.C.M., Lenstra J.K., and Parrow J. (Eds). Automata, Languages and Programming. Lecture Notes in Computer Science vol. 2719 (2003), Springer, Berlin 397-409
13. B. Hoppe, Efficient dynamic network flow algorithms. PhD Thesis, Cornell University, 1995
14. Hoppe B., and Tardos É. The quickest transshipment problem. Mathematics of Operations Research 25 (2000) 36-62
15. Klinz B., and Woeginger G.J. Minimum-cost dynamic flows: The series-parallel case. Networks 43 (2004) 153-162
16. Lui K.-S., and Zaks S. Scheduling in synchronous networks and the greedy algorithm. Theoretical Computer Science 220 (1999) 157-183
17. Megiddo N. Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4 (1979) 414-424
18. Powell W.B., Jaillet P., and Odoni A. Stochastic and dynamic networks and routing. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser (Eds). Network Routing. Handbooks in Operations Research and Management Science vol. 8 (1995), North-Holland, Amsterdam, The Netherlands 141-295 (Chapter 3)