Improved algorithms for submodular function minimization and submodular flow
- 1 May 2000
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 107-116
- https://doi.org/10.1145/335305.335318
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial TimeJournal of Combinatorial Theory, Series B, 2000
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functionsPublished by Association for Computing Machinery (ACM) ,2000
- Minimizing symmetric submodular functionsMathematical Programming, 1998
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- On submodular function minimizationCombinatorica, 1985
- Finding feasible vectors of Edmonds-Giles polyhedraJournal of Combinatorial Theory, Series B, 1984
- Testing membership in matroid polyhedraJournal of Combinatorial Theory, Series B, 1984
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier BV ,1977