Log In Sign Up

On the Complexity of Dynamic Submodular Maximization

by   Xi Chen, et al.

We study dynamic algorithms for the problem of maximizing a monotone submodular function over a stream of n insertions and deletions. We show that any algorithm that maintains a (0.5+ϵ)-approximate solution under a cardinality constraint, for any constant ϵ>0, must have an amortized query complexity that is 𝑝𝑜𝑙𝑦𝑛𝑜𝑚𝑖𝑎𝑙 in n. Moreover, a linear amortized query complexity is needed in order to maintain a 0.584-approximate solution. This is in sharp contrast with recent dynamic algorithms of [LMNF+20, Mon20] that achieve (0.5-ϵ)-approximation with a 𝗉𝗈𝗅𝗒log(n) amortized query complexity. On the positive side, when the stream is insertion-only, we present efficient algorithms for the problem under a cardinality constraint and under a matroid constraint with approximation guarantee 1-1/e-ϵ and amortized query complexities O(log (k/ϵ)/ϵ^2) and k^Õ(1/ϵ^2)log n, respectively, where k denotes the cardinality parameter or the rank of the matroid.


page 1

page 2

page 3

page 4


A Note on Monotone Submodular Maximization with Cardinality Constraint

We show that for the cardinality constrained monotone submodular maximiz...

Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization

We study parallelizable algorithms for maximization of a submodular func...

Streaming Submodular Maximization with Matroid and Matching Constraints

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

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel

For the problem of maximizing a monotone, submodular function with respe...

Efficient Algorithms for Monotone Non-Submodular Maximization with Partition Matroid Constraint

In this work, we study the problem of monotone non-submodular maximizati...

Fully Dynamic Algorithm for Constrained Submodular Optimization

The task of maximizing a monotone submodular function under a cardinalit...

Efficient Determinant Maximization for All Matroids

Determinant maximization provides an elegant generalization of problems ...