Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time
share
We study the problem of maximizing a non-monotone, non-negative submodular function subject to a matroid constraint. The prior best-known deterministic approximation ratio for this problem is 1/4-ϵ under 𝒪((n^4/ϵ)log n) time complexity. We show that this deterministic ratio can be improved to 1/4 under 𝒪(nr) time complexity, and then present a more practical algorithm dubbed TwinGreedyFast which achieves 1/4-ϵ deterministic ratio in nearly-linear running time of 𝒪(n/ϵlogr/ϵ). Our approach is based on a novel algorithmic framework of simultaneously constructing two candidate solution sets through greedy search, which enables us to get improved performance bounds by fully exploiting the properties of independence systems. As a byproduct of this framework, we also show that TwinGreedyFast achieves 1/2p+2-ϵ deterministic ratio under a p-set system constraint with the same time complexity. To showcase the practicality of our approach, we empirically evaluated the performance of TwinGreedyFast on two network applications, and observed that it outperforms the state-of-the-art deterministic and randomized algorithms with efficient implementations for our problem.
READ FULL TEXT
