A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
Top Cited Papers
- 1 November 2000
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 80 (2) , 346-355
- https://doi.org/10.1006/jctb.2000.1989
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functionsPublished by Association for Computing Machinery (ACM) ,2000
- Minimizing symmetric submodular functionsMathematical Programming, 1998
- On submodular function minimizationCombinatorica, 1985
- The Partial Order of a Polymatroid Extreme PointMathematics of Operations Research, 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
- Computing Maximal “Polymatroidal” Network FlowsMathematics of Operations Research, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Maximal Closure of a Graph and Applications to Combinatorial ProblemsManagement Science, 1976
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970