Unconstrained submodular maximization with constant adaptive complexity

DOI10.1145/3313276.3316327zbMath1433.68592arXiv1811.06603OpenAlexW2963829849MaRDI QIDQ5212751

Amin Karbasi, Lin Chen, Moran Feldman

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.06603

zbMATH Keywords

parallel computationsubmodular maximizationlow adaptive complexity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)

Related Items (2)

A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions ⋮ Unnamed Item

This page was built for publication: Unconstrained submodular maximization with constant adaptive complexity