Title of article
A note on Schrijverʹs submodular function minimization algorithm
Author/Authors
Vygen، نويسنده , , Jens، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
4
From page
399
To page
402
Abstract
We prove that Schrijverʹs submodular function minimization algorithm is faster by a factor of n than was proved by Schrijver in his paper.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series B
Record number
1527275
Link To Document