An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint
From MaRDI portal
Publication:6614024
DOI10.1016/j.tcs.2024.114798MaRDI QIDQ6614024
Qizhi Fang, Bin Liu, Shufang Gong
Publication date: 7 October 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Simultaneous approximation of multi-criteria submodular function maximization
- New performance guarantees for the greedy maximization of submodular set functions
- Optimization, approximation, and complexity classes
- On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
- A constrained two-stage submodular maximization
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Maximizing Social Influence in Nearly Optimal Time
- Fast algorithms for maximizing submodular functions
This page was built for publication: An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint
