Abstract
Purchase PDF (280 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (4)
Purchase PDF (555 K)
doi:10.1016/S0166-218X(02)00458-4 
Copyright © 2003 Elsevier B.V. All rights reserved.
A push-relabel framework for submodular function minimization and applications to parametric optimization*1
Received 12 January 2001;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Recently, the first combinatorial strongly polynomial algorithms for submodular function minimization have been devised independently by Iwata, Fleischer, and Fujishige and by Schrijver. In this paper, we improve the running time of Schrijver's algorithm by designing a push-relabel framework for submodular function minimization (SFM). We also extend this algorithm to carry out parametric minimization for a strong map sequence of submodular functions in the same asymptotic running time as a single SFM. Applications include an efficient algorithm for finding a lexicographically optimal base.
Author Keywords: Submodular function; Parametric optimization
