Improved algorithms for submodular function minimization and submodular flow

DOI10.1145/335305.335318zbMath1296.90103OpenAlexW2020165787MaRDI QIDQ3191977

Satoru Iwata, Lisa K. Fleischer

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335318

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

A note on Schrijver's submodular function minimization algorithm. ⋮ A note on polylinking flow networks ⋮ The complexity of soft constraint satisfaction ⋮ A flow model based on polylinking system ⋮ Submodular function minimization ⋮ A faster strongly polynomial time algorithm for submodular function minimization

This page was built for publication: Improved algorithms for submodular function minimization and submodular flow