Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time

by   Kai Han, et al.

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.


page 9

page 18

∙ 02/17/2019

Nearly Linear-Time, Deterministic Algorithm for Maximizing (Non-Monotone) Submodular Functions Under Cardinality Constraint

A deterministic, nearly linear-time, approximation algorithm FastInterla...
∙ 06/14/2023

Measures and Optimization for Robustness and Vulnerability in Disconnected Networks

The function or performance of a network is strongly dependent on its ro...
∙ 06/14/2021

The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization

Submodular optimization has numerous applications such as crowdsourcing ...
∙ 05/09/2021

Fast n-fold Boolean Convolution via Additive Combinatorics

We consider the problem of computing the Boolean convolution (with wrapa...
∙ 08/30/2022

Improved Deterministic Algorithms for Non-monotone Submodular Maximization

Submodular maximization is one of the central topics in combinatorial op...
∙ 11/19/2018

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

We consider fast algorithms for monotone submodular maximization subject...
∙ 05/25/2022

Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization

We propose a two-phase systematical framework for approximation algorith...

Please sign up or login with your details

Forgot password? Click here to reset