The following publications are possibly variants of this publication:
- A capacity scaling algorithm for convex cost submodular flowsSatoru Iwata. mp, 76:299-308, 1996.
- A Capacity Scaling Algorithm for Convex Cost Submodular FlowsSatoru Iwata. soda 1996: 482-489
- A fast cost scaling algorithm for submodular flowSatoru Iwata, S. Thomas McCormick, Maiko Shigeno. ipl, 74(3-4):123-128, 2000. [doi]
- A faster capacity scaling algorithm for minimum cost submodular flowLisa Fleischer, Satoru Iwata, S. Thomas McCormick. mp, 92(1):119-139, 2002. [doi]
- A Faster Algorithm for Minimum Cost Submodular FlowsSatoru Iwata, S. Thomas McCormick, Maiko Shigeno. soda 1998: 167-174
- A capacity scaling algorithm for M-convex submodular flowSatoru Iwata, Satoko Moriguchi, Kazuo Murota. mp, 103(1):181-202, 2005. [doi]
- A Capacity Scaling Algorithm for M-convex Submodular FlowSatoru Iwata, Satoko Moriguchi, Kazuo Murota. ipco 2004: 352-367 [doi]
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular FlowSatoru Iwata, S. Thomas McCormick, Maiko Shigeno. siamdm, 19(2):304-320, 2005. [doi]
- Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*Satoru Iwata, S. Thomas McCormick, Maiko Shigeno. combinatorica, 23(3):503-525, 2003. [doi]
- Improved algorithms for submodular function minimization and submodular flowLisa Fleischer, Satoru Iwata. stoc 2000: 107-116 [doi]