A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableAll Related Versions
This publication has 21 references indexed in Scilit:
- A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial TimeJournal of Combinatorial Theory, Series B, 2000
- Minimizing submodular functions over families of setsCombinatorica, 1995
- A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned MatricesSIAM Journal on Matrix Analysis and Applications, 1995
- A rounding technique for the polymatroid membership problemLinear Algebra and its Applications, 1995
- A unifying location model on tree graphs based on submodularity propertiesDiscrete Applied Mathematics, 1993
- Testing membership in matroid polyhedraJournal of Combinatorial Theory, Series B, 1984
- Submodular systems and related topicsPublished by Springer Nature ,1984
- The capacity region of general multiple-access channel with certain correlated sourcesInformation and Control, 1979
- Polymatroidal dependence structure of a set of random variablesInformation and Control, 1978
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972