A combinatorial strongly polynomial algorithm for minimizing submodular functions
Top Cited Papers
- 1 July 2001
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 48 (4), 761-777
- https://doi.org/10.1145/502090.502096
Abstract
No abstract availableKeywords
Other Versions
This publication has 29 references indexed in Scilit:
- A faster capacity scaling algorithm for minimum cost submodular flowMathematical Programming, 2002
- Minimizing submodular functions over families of setsCombinatorica, 1995
- A unifying location model on tree graphs based on submodularity propertiesDiscrete Applied Mathematics, 1993
- Two strongly polynomial cut cancelling algorithms for minimum cost network flowDiscrete Applied Mathematics, 1993
- An application of submodular flowsLinear Algebra and its Applications, 1989
- Submodular systems and related topicsPublished by Springer Science and Business Media LLC ,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
- Cores of convex gamesInternational Journal of Game Theory, 1971