Additional Key Words and Phrases: network flows, transportation problem, analysis of algorithms
Selected papers that cite this one
- Egon Balas, Donald Miller, Joseph Pekny, and Paolo Toth. A parallel shortest augmenting path algorithm for the assignment problem. Journal of the ACM, 38(4):985-1004, October 1991.
- Francisco Barahona and Éva Tardos. Note on Weintraub's minimum-cost circulation algorithm. SIAM Journal on Computing, 18(3):579-583, June 1989.
- Joseph Cheriyan and Torben Hagerup. A randomized maximum-flow algorithm. SIAM Journal on Computing, 24(2):203-226, April 1995.
- Xiaotie Deng, Toshihide Ibaraki, and Hiroshi Nagamochi. Combinatorial optimization games. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 720-729, New Orleans, Louisiana, 5-7 January 1997.
- Harold N. Gabow and Robert E. Tarjan. Faster scaling algorithms for general graph-matching problems. Journal of the ACM, 38(4):815-853, October 1991.
- Zvi Galil and Xiangdong Yu. Short length versions of Menger's theorem (extended abstract). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 499-508, Las Vegas, Nevada, 29 May-1 June 1995.
- Andrew V. Goldberg and Satish Rao. Beyond the flow decomposition barrier. In 38th Annual Symposium on Foundations of Computer Science, pages 2-11, Miami Beach, Florida, 20-22 October 1997. IEEE.
- Malika Hadjiat. Penelope's graph: a hard minimum cost tension instance. Theoretical Computer Science, 194(1-2):207-218, 10 March 1998.
- Dorit S. Hochbaum and J. George Shanthikumar. Convex separable optimization is not much harder than linear optimization. Journal of the ACM, 37(4):843-862, October 1990.
- Satoru Iwata, S. Thomas McCormick, and Maiko Shigeno. A faster algorithm for minimum cost submodular flows. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 167-174, San Francisco, California, 25-27 January 1998.
- Donald B. Johnson. A note on Dijkstra's shortest path algorithm. Journal of the ACM, 20(3):385-388, July 1973.
- David R. Karger and Clifford Stein. A new approach to the minimum cut problem. Journal of the ACM, 43(4):601-640, July 1996.
- G. Ramalingam and Thomas Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158(1-2):233-277, 20 May 1996.
- G. Ramalingam and Thomas Reps. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms, 21(2):267-305, September 1996.
- Alexander D. Stoyenko, Jan Bosch, Mehmet Ak\c{s}it, and Thomas J. Marlowe. Load balanced mapping of distributed objects to minimize network communication. Journal of Parallel and Distributed Computing, 34(2):117-136, 1 May 1996.
- Takeshi Tokuyama and Jun Nakano. Efficient algorithms for the Hitchcock transportation problem. SIAM Journal on Computing, 24(3):563-578, June 1995.
- Norman Zadeh. Theoretical efficiency of the Edmonds-Karp algorithm for computing maximal flows. Journal of the ACM, 19(1):184-192, January 1972.