Comparing apples and oranges: query tradeoff in submodular maximization

DOI10.1137/1.9781611973730.77MaRDI QIDQ6829834zbMATH OpenFDO

Authors Niv Buchbinder, Moran Feldman, Roy Schwartz

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/228307

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27)

Cited in

(2)

• Efficient deterministic algorithms for maximizing symmetric submodular functions
• Practical parallel algorithms for non-monotone submodular maximization

This page was built for publication: Comparing apples and oranges: query tradeoff in submodular maximization

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