Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time

Abstract

A deterministic approximation algorithm is presented for the maximization of non-monotone submodular functions over a ground set of size $n$ subject to cardinality constraint $k$; the algorithm is based upon the idea of interlacing two greedy procedures. The algorithm uses interlaced, thresholded greedy procedures to obtain tight ratio $1/4-\epsilon$ in $O\left(\frac{n}{\epsilon }\log \left(\frac{k}{\epsilon }\right)\right)$ queries of the objective function, which improves upon both the ratio and the quadratic time complexity of the previously fastest deterministic algorithm for this problem. The algorithm is validated in the context of two applications of non-monotone submodular maximization, on which it outperforms the fastest deterministic and randomized algorithms in prior literature.

16 pages, 8 figures

Cited by in corpus (6)

• How Do You Want Your Greedy: Simultaneous or Repeated?
• Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time
• Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time
• Simultaenous Sieves: A Deterministic Streaming Algorithm for Non-Monotone Submodular Maximization
• The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization
• Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint