The one-way communication complexity of submodular maximization with applications to streaming and robustness

DOI10.1145/3357713.3384286OpenAlexW3035181444MaRDI QIDQ5145019FDOQ5145019

Moran Feldman, Rico Zenklusen, Ola Svensson, Ashkan Norouzi-Fard

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://arxiv.org/abs/2003.13459

zbMATH Keywords

robustnessapproximation algorithmscommunication complexitystreamingsubmodular maximization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (9)

• Streaming submodular maximization with the chance constraint
• Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
• Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions
• A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
• FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
• Multi-pass streaming algorithms for monotone submodular function maximization
• Fast algorithms for maximizing monotone nonsubmodular functions

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Lower bounds for one-way probabilistic communication complexity and their application to space complexity 👍 👎
• Streaming and Communication Complexity of Clique Approximation 👍 👎
• Streaming algorithms for robust submodular maximization 👍 👎
• Streaming Algorithms for Submodular Function Maximization 👍 👎
• An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint 👍 👎
• Robust lower bounds for communication and stream computation 👍 👎
• Communication Complexity of Combinatorial Auctions with Submodular Valuations 👍 👎

This page was built for publication: The one-way communication complexity of submodular maximization with applications to streaming and robustness

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