A faster capacity scaling algorithm for minimum cost submodular flow

We describe an O(n4hmin{logU,n2logn}) 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 re...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 92; no. 1; pp. 119 - 139
Main Authors:	Fleischer, Lisa, Iwata, Satoru, McCormick, S. Thomas
Format:	Journal Article
Language:	English
Published:	Heidelberg Springer Nature B.V 01.03.2002
Subjects:	Algorithms
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!