Journal
JOURNAL OF COMBINATORIAL THEORY SERIES B
Volume 80, Issue 2, Pages 346-355Publisher
ACADEMIC PRESS INC
DOI: 10.1006/jctb.2000.1989
Keywords
-
Categories
Ask authors/readers for more resources
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed lo be known a priori. The number of oracle calls is bounded by a polynomial in the size of the underlying set. (C) 2000 Academic Press.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available