A note on Schrijver's submodular function minimization algorithm

Authors:
Jens Vygen
Affiliations:
Research Institute for Discrete Mathematics, University of Bonn, Lennéstrasse 2, 53113 Bonn, Germany
Venue:
Journal of Combinatorial Theory Series B
Year:
2003

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved algorithms for submodular function minimization and submodular flow

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
A Faster Scaling Algorithm for Minimizing Submodular Functions

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

Hi-index	0.00

We prove that Schrijver's submodular function minimization algorithm is faster by a factor of n than was proved by Schrijver in his paper.