A capacity scaling algorithm for convex cost submodular flows

Authors:
Satoru Iwata
Affiliations:
Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606, Japan
Venue:
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Year:
1996

Citing 5
Cited 1

Layered augmenting path algorithms

Mathematics of Operations Research
Generalized polymatroids and submodular flows

Mathematical Programming: Series A and B
Convex separable optimization is not much harder than linear optimization

Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)

On the complexity of submodular function minimisation on diamonds

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract