A strongly polynomial algorithm for minimum cost submodular flow problems

Authors:
S. Fujishige;H. Röck;U. Zimmermann
Affiliations:
Univ. of Tsukuba, Tsukuba, Japan;Technische Univ. Berlin, Berlin, W. Germany;Technische Univ. Braunschweig, Braunschweig, W. Germany
Venue:
Mathematics of Operations Research
Year:
1989

A faster algorithm for minimum cost submodular flows

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for submodular function minimization and submodular flow

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The edge-orientation problem and some of its variants on weighted graphs

Information Sciences: an International Journal

Hi-index	0.01