A combinatorial strongly polynomial algorithm for minimizing submodular functions

DOI10.1145/502090.502096MaRDI QIDQ6829277zbMATH OpenFDO

Authors Satoru Iwata, Lisa Fleischer, Satoru Fujishige

Publication date 11 February 2008

Published in Journal of the ACM (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

This page was built for publication: A combinatorial strongly polynomial algorithm for minimizing submodular functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829277)