Quickest flows over time

SIAM Journal on Computing

Volumn 36, Issue 6, 2007, Pages 1600-1630

  Fleischer, Lisa ^a   Skutella, Martin ^b  

^a Dartmouth College   (United States)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Dynamic flows; Earliest arrival flows; Flows over time; Network flows; Quickest flows

Indexed keywords

DYNAMIC FLOWS; EARLIEST ARRIVAL FLOWS; FLOWS OVER TIME; NETWORK FLOWS; QUICKEST FLOWS;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL MODELS;

PROBLEM SOLVING;

EID: 34247544986     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703427215     Document Type: Article

References (36)

1. F. AFRATI, E. BAMPIS, C. CHEKURI, D. KARGER, C. KENYON, S. KHANNA, I. MILIS, M. QUEYRANNE, M. SKUTELLA, C. STEIN, AND M. SVIRIDENKO, Approximation schemes for minimizing average weighted completion time with release dates, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York City, NY, 1999, pp. 32-43.
2. J. E. ARONSON, A survey of dynamic network flows, Ann. Oper. Res., 20 (1989), pp. 1-66.
3. R. E. BURKARD, K. DLASKA, AND B. KLINZ, The quickest flow problem, ZOR Methods Models Oper. Res., 37 (1993), pp. 31-58.
4. S. CHAKRABARTI, C. PHILLIPS, A. S. SCHULZ, D. B. SHMOYS, C. STEIN, AND J. WEIN, Improved scheduling algorithms for minsum criteria, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1099, F. Meyer auf der Heide and B. Monien, eds., Springer, Berlin, 1996, pp. 646-657.
5. F. A. CHUDAK AND D. B. SHMOYS, Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds, J. Algorithms, 30 (1999), pp. 323-343.
6. L. FLEISCHER AND M. SKUTELLA, The quickest multicommodity flow problem, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 2337, W. J. Cook and A. S. Schulz, eds., Springer, Berlin, 2002, pp. 36-53.
7. L. FLEISCHER AND M. SKUTELLA, Minimum cost flows over time without intermediate storage, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 66-75.
8. L. K. FLEISCHER, Approximating fractional multicommodity flows independent of the number of commodities, SIAM J. Discrete Math., 13 (2000), pp. 505-520.
9. L. K. FLEISCHER, Faster algorithms for the quickest transshipment problem, SIAM J. Optim., 12 (2001), pp. 18-35.
10. L. K. FLEISCHER, Universally maximum flow with piece-wise constant capacity functions, Networks, 38 (2001), pp. 1-11.
11. L. K. FLEISCHER AND E. TARDOS, Efficient continuous-time dynamic network flow algorithms, Oper. Res. Lett., 23 (1998), pp. 71-80.
12. L. R. FORD AND D. R. FULKERSON, Constructing maximal dynamic flows from static flows, Oper. Res., 6 (1958), pp. 419-433.
13. L. R. FORD AND D. R. FULKERSON, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
14. D. GALE, Transient flows in networks, Michigan Math. J., 6 (1959), pp. 59-63.
15. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
16. 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, Palo Alto, CA, 1998, pp. 300-309.
17. M. GRPÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Algorithms Combin., Springer, Berlin, 1988.
18. B. HAJEK AND R. G. OGIER, Optimal dynamic routing in communication networks with continuous traffic, Networks, 14 (1984), pp. 457-487.
19. A. HALL, S. HIPPLER, AND M. SKUTELLA, Multicommodity flows overtime: Efficient algorithms and complexity, Theoret. Comput. Sci., to appear.
20. L. A. HALL, A. S. SCHULZ, D. B. SHMOYS, AND J. WEIN, Scheduling to minimize average completion time: Off-line and on-line approximation algorithms, Math. Oper. Res., 22 (1997), pp. 513-544.
21. R. HASSIN, Approximation schemes for the restricted shortest path problem, Math. Oper. Res., 17 (1992), pp. 36-42.
22. B. HOPPE, Efficient Dynamic Network Flow Algorithms, Ph.D. thesis, Cornell University, Ithaca, NY, 1995.
23. B. HOPPE AND É. TARDOS, Polynomial time algorithms for some evacuation problems, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, 1994, pp. 433-441.
24. B. HOPPE AND E. TARDOS, The quickest transshipment problem, Math. Oper. Res., 25 (2000), pp. 36-62.
25. B. KLINZ AND G. J. WOEGINGER, Minimum-cost dynamic flows: The series-parallel case, Networks, 43 (2004), pp. 153-162.
26. D. H. LORENZ AND D. RAZ, A simple efficient approximation scheme for the restricted shortest path problem, Oper. Res. Lett., 28 (2001), pp. 213-219.
27. N. MEGIDDO, Combinatorial optimization with rational objective functions, Math. Oper. Res., 4 (1979), pp. 414-424.
28. E. MINIEKA, Maximal, lexicographic, and dynamic network flows, Oper. Res., 21 (1973), pp. 517-527.
29. R. G. OGIER, Minimum-delay routing in continuous-time dynamic networks with piecewise-constant capacities, Networks, 18 (1988), pp. 303-318.
30. J. B. ORLIN, Minimum convex cost dynamic network flows, Math. Oper. Res., 9 (1984), pp. 190-207.
31. C. A. PHILLIPS, The network inhibition problem, in Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA, 1993, pp. 776-785.
32. A. B. PHILPOTT, Continuous-time flows in networks, Math. Oper. Res., 15 (1990), pp. 640-661.
33. W. B. POWELL, P. JAILLET, AND A. ODONI, Stochastic and dynamic networks and routing, in Network Routing, Handbooks Oper. Res. Management Sci. 8, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds., North-Holland, Amsterdam, 1995, Chap. 3, pp. 141-295.
34. D. RICHARDSON AND É. TARDOS, private communication, 2002.
35. W. L. WILKINSON, An algorithm for universal maximal dynamic flows in a network, Oper. Res., 19 (1971), pp. 1602-1612.
36. N. ZADEH, A bad network problem for the simplex method and other minimum cost flow algorithms, Math. Program., 5 (1973), pp. 255-266.