A faster strongly polynomial time algorithm for submodular function minimization
Top Cited Papers
- 20 November 2007
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 118 (2), 237-251
- https://doi.org/10.1007/s10107-007-0189-2
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Submodular function minimizationMathematical Programming, 2007
- Submodular Functions, Matroids, and Certain PolyhedraPublished by Springer Science and Business Media LLC ,2003
- A Faster Scaling Algorithm for Minimizing Submodular FunctionsSIAM Journal on Computing, 2003
- A combinatorial strongly polynomial algorithm for minimizing submodular functionsJournal of the ACM, 2001
- Improved algorithms for submodular function minimization and submodular flowPublished by Association for Computing Machinery (ACM) ,2000
- Nonnegative Matrices in the Mathematical SciencesPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- Geometric Algorithms and Combinatorial OptimizationAlgorithms and Combinatorics, 1988
- On submodular function minimizationCombinatorica, 1985
- Submodular functions and convexityPublished by Springer Science and Business Media LLC ,1983
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981