DeepAI AI Chat
Log In Sign Up

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

10/27/2020
by   Alan Kuhnle, et al.
0

In this work, we present a combinatorial, deterministic single-pass streaming algorithm for the problem of maximizing a submodular function, not necessarily monotone, with respect to a cardinality constraint (SMCC). In the case the function is monotone, our algorithm reduces to the optimal streaming algorithm of Badanidiyuru et al. (2014). In general, our algorithm achieves ratio α / (1 + α) - ε, for any ε > 0, where α is the ratio of an offline (deterministic) algorithm for SMCC used for post-processing. Thus, if exponential computation time is allowed, our algorithm deterministically achieves nearly the optimal 1/2 ratio. These results nearly match those of a recently proposed, randomized streaming algorithm that achieves the same ratios in expectation. For a deterministic, single-pass streaming algorithm, our algorithm achieves in polynomial time an improvement of the best approximation factor from 1/9 of previous literature to ≈ 0.2689.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/30/2022

Improved Deterministic Algorithms for Non-monotone Submodular Maximization

Submodular maximization is one of the central topics in combinatorial op...
11/29/2019

An Optimal Streaming Algorithm for Non-monotone Submodular Maximization

We study the problem of maximizing a non-monotone submodular function su...
09/10/2020

Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time

We consider the problem of monotone, submodular maximization over a grou...
02/20/2018

Do Less, Get More: Streaming Submodular Maximization with Subsampling

In this paper, we develop the first one-pass streaming algorithm for sub...
09/13/2018

Submodular Secretary Problem with Shortlists

In , the goal is to select k items in a randomly ordered input so as to ...
04/14/2021

Streaming Algorithms for Cardinality-Constrained Maximization of Non-Monotone Submodular Functions in Linear Time

For the problem of maximizing a nonnegative, (not necessarily monotone) ...