A Fully Combinatorial Algorithm for Submodular Function Minimization
- 1 March 2002
- journal article
- Published by Elsevier BV in Journal of Combinatorial Theory, Series B
- Vol. 84 (2), 203-212
- https://doi.org/10.1006/jctb.2001.2072
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial TimeJournal of Combinatorial Theory, Series B, 2000
- Minimizing symmetric submodular functionsMathematical Programming, 1998
- A capacity scaling algorithm for convex cost submodular flowsMathematical Programming, 1997
- Computing Edge-Connectivity in Multigraphs and Capacitated GraphsSIAM Journal on Discrete Mathematics, 1992
- Generalized polymatroids and submodular flowsMathematical Programming, 1988
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithmMathematical Programming, 1986
- 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