A lower bound for parallel submodular minimization

DOI10.1145/3357713.3384287OpenAlexW3034847651MaRDI QIDQ5144903

Eric Balkanski, Yaron Singer

Publication date: 19 January 2021

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

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

zbMATH Keywords

adaptivityparallel algorithmssubmodular minimization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint ⋮ Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty

This page was built for publication: A lower bound for parallel submodular minimization