Title of article :
A Fully Combinatorial Algorithm for Submodular Function Minimization
Author/Authors :
Iwata، نويسنده , , Satoru، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Abstract :
This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
