A note on Schrijver's submodular function minimization algorithm
Author:
- 24 December 2002
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 88 (2) , 399-402
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial TimeJournal of Combinatorial Theory, Series B, 2000
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions2000
- Improved algorithms for submodular function minimization and submodular flow2000