A good algorithm for lexicographically optimal flows in multi-terminal networks
HTML articles powered by AMS MathViewer
- by Nimrod Megiddo PDF
- Bull. Amer. Math. Soc. 83 (1977), 407-409
References
- E. A. Dinic, An algorithm for the solution of the problem of maximal flow in a network with power estimation, Dokl. Akad. Nauk SSSR 194 (1970), 754–757 (Russian). MR 0287976
- Jack Edmonds, Paths, trees, and flowers, Canadian J. Math. 17 (1965), 449–467. MR 177907, DOI 10.4153/CJM-1965-045-4 3. J. Edmonds and R. M. Karp, Theoretical improvements in algorithm efficiency for network flow problems, J. Assoc. Comput. Mach. 19 (1972), 248-264.
- Shimon Even and R. Endre Tarjan, Network flow and testing graph connectivity, SIAM J. Comput. 4 (1975), no. 4, 507–518. MR 436964, DOI 10.1137/0204043
- L. R. Ford Jr. and D. R. Fulkerson, Flows in networks, Princeton University Press, Princeton, N.J., 1962. MR 0159700
- A. V. Karzanov, The problem of finding the maximal flow in a network by the method of preflows, Dokl. Akad. Nauk SSSR 215 (1974), 49–52 (Russian). MR 0343879
- Nimrod Megiddo, Optimal flows in networks with multiple sources and sinks, Math. Programming 7 (1974), 97–107. MR 363440, DOI 10.1007/BF01585506
Additional Information
- Journal: Bull. Amer. Math. Soc. 83 (1977), 407-409
- MSC (1970): Primary 90B10, 90C35; Secondary 05C35, 94A20, 68A10
- DOI: https://doi.org/10.1090/S0002-9904-1977-14298-5
- MathSciNet review: 0432205