A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
A faster capacity scaling algorithm for minimum cost submodular flow
2002
Mathematical programming
We describe an O(n 4 h min{log U, n 2 log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds-Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter δ. Capacities are relaxed by attaching a complete directed graph with uniform arc capacity δ in each scaling phase. We then modify a feasible submodular flow by relaxing
doi:10.1007/s101070100253
fatcat:bsp6apx4arcnxfbeknk3lq5yyi