Submodular optimization in the MapReduce model

DOI10.4230/OASICS.SOSA.2019.18MaRDI QIDQ6593574zbMATH OpenFDO

Authors Paul C. Liu, Jan Vondrák

Publication date 26 August 2024

Full work available at URL https://doi.org/10.4230/OASICS.SOSA.2019.18

zbMATH Keywords

approximation algorithmsMapReducesubmodular optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Distributed algorithms (68W15)

Recommendations

• Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models
• Distributed submodular maximization
• Randomized composable core-sets for distributed submodular maximization
• Submodular maximization with nearly optimal approximation, adaptivity and query complexity
• A survey on streaming algorithms for maximizing submodular functions

Cited in

(3)

• Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models
• Subquadratic submodular maximization with a general matroid constraint
• The one-way communication complexity of submodular maximization with applications to streaming and robustness

This page was built for publication: Submodular optimization in the MapReduce model

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