A Faster Scaling Algorithm for Minimizing Submodular Functions
Author:
- 21 May 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A push-relabel framework for submodular function minimization and applications to parametric optimizationDiscrete Applied Mathematics, 2003
- 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 Optimization1988
- 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
- Cores of convex gamesInternational Journal of Game Theory, 1971