A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
- 25 June 2007
- book chapter
- Published by Springer Nature
- p. 240-251
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Faster Scaling Algorithm for Minimizing Submodular FunctionsSIAM Journal on Computing, 2003
- A note on Schrijver's submodular function minimization algorithmJournal 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
- Improved algorithms for submodular function minimization and submodular flow2000
- Nonnegative Matrices in the Mathematical Sciences1994
- Geometric Algorithms and Combinatorial Optimization1988
- On submodular function minimizationCombinatorica, 1985
- Submodular functions and convexity1983
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981