DeepAI AI Chat
Log In Sign Up

An Optimal Streaming Algorithm for Non-monotone Submodular Maximization

by   Alina Ene, et al.
Boston University
Princeton University

We study the problem of maximizing a non-monotone submodular function subject to a size constraint in the streaming model. Our main contribution is a single-pass streaming algorithm that uses k·poly(1/ϵ) memory, where k is the size constraint. At the end of the stream, we post-process the output of the algorithm using any offline algorithm for submodular maximization, and we obtain a solution whose approximation guarantee is α/1+α-ϵ, where α is the approximation of the offline algorithm. If we use an exact (exponential time) post-processing algorithm, we obtain a 1/2-ϵ approximation, almost matching the lower bound of [Alaluf-Feldman, 2019]. If we post-process with the algorithm of [Buchbinder-Feldman, Math of OR 2019] that achieves the currently best approximation guarantee α=0.385, we obtain a 0.2779 approximation in polynomial time, improving over the previously best polynomial-time approximation of 0.2335 due to [Alaluf-Feldman, 2019]. In addition to its improved approximation guarantee, our algorithm enjoys a fast update time and overall running time.


page 1

page 2

page 3

page 4


Streaming Submodular Maximization with Matroid and Matching Constraints

Recent progress in (semi-)streaming algorithms for monotone submodular f...

Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints

We give improved multi-pass streaming algorithms for the problem of maxi...

Simultaenous Sieves: A Deterministic Streaming Algorithm for Non-Monotone Submodular Maximization

In this work, we present a combinatorial, deterministic single-pass stre...

Improved Submodular Secretary Problem with Shortlists

First, for the for the submodular k-secretary problem with shortlists [1...

Optimal deletion-robust coreset for submodular maximization

In recent years we have witnessed an increase on the development of meth...

Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online

The framework of budget-feasible mechanism design studies procurement au...

Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint

We consider fast algorithms for monotone submodular maximization subject...