A Faster Scaling Algorithm for Minimizing Submodular Functions
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 32 (4), 833-840
- https://doi.org/10.1137/s0097539701397813
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A faster capacity scaling algorithm for minimum cost submodular flowMathematical Programming, 2002
- A Fully Combinatorial Algorithm for Submodular Function MinimizationJournal of Combinatorial Theory, Series B, 2002
- A combinatorial strongly polynomial algorithm for minimizing submodular functionsJournal of the ACM, 2001
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial TimeJournal of Combinatorial Theory, Series B, 2000
- Geometric Algorithms and Combinatorial OptimizationAlgorithms and Combinatorics, 1988
- On submodular function minimizationCombinatorica, 1985
- Testing membership in matroid polyhedraJournal of Combinatorial Theory, Series B, 1984
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Combinatorial TheoryGrundlehren der mathematischen Wissenschaften, 1979