Fully Dynamic Submodular Maximization over Matroids

Abstract

Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning. We study this classic problem in the fully dynamic setting, where elements can be both inserted and deleted in real-time. Our main result is a randomized algorithm that maintains an efficient data structure with an $\tilde{O}(k^2)$ amortized update time (in the number of additions and deletions) and yields a $4$-approximate solution, where $k$ is the rank of the matroid.

arXiv commentAccepted at ICML 2023

References in corpus (9)

• Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
• Do Less, Get More: Streaming Submodular Maximization with Subsampling
• Robust Monotone Submodular Function Maximization
• Robust Submodular Maximization: A Non-Uniform Partitioning Approach
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
• Fairness in Streaming Submodular Maximization: Algorithms and Hardness
• Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
• Fully Dynamic Submodular Maximization over Matroids
• Dynamic Algorithms for Matroid Submodular Maximization

Cited by in corpus (1)

• Fully Dynamic Submodular Maximization over Matroids