2000
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Publication
Publication
Journal of Combinatorial Theory - Series B , Volume 80 - Issue 2 p. 346- 355
Additional Metadata | |
---|---|
, | |
Academic Press | |
Journal of Combinatorial Theory - Series B | |
Organisation | Networks and Optimization |
Schrijver, L. (2000). A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory - Series B, 80(2), 346–355. |