A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
DOI10.1145/335305.335317zbMath1296.90104arXivmath/0004089WikidataQ62111282 ScholiaQ62111282MaRDI QIDQ3191976
Satoru Iwata, Lisa K. Fleischer, Satoru Fujishige
Publication date: 26 September 2014
Published in: Journal of the ACM, Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0004089
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
