Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2111.03198
Cited By
v1
v2 (latest)
On the Complexity of Dynamic Submodular Maximization
5 November 2021
Xi Chen
Binghui Peng
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"On the Complexity of Dynamic Submodular Maximization"
4 / 4 papers shown
Title
The Cost of Consistency: Submodular Maximization with Constant Recourse
Paul Dutting
Federico Fusco
Silvio Lattanzi
A. Norouzi-Fard
O. Svensson
Morteza Zadimoghaddam
105
0
0
03 Dec 2024
A Dynamic Algorithm for Weighted Submodular Cover Problem
Kiarash Banihashem
Samira Goudarzi
Mohammadtaghi Hajiaghayi
Peyman Jabbarzade
M. Monemizadeh
87
0
0
13 Jul 2024
Dynamic Non-monotone Submodular Maximization
Kiarash Banihashem
Leyla Biabani
Samira Goudarzi
Mohammadtaghi Hajiaghayi
Peyman Jabbarzade
M. Monemizadeh
68
3
0
07 Nov 2023
Fully Dynamic Submodular Maximization over Matroids
Paul Dutting
Federico Fusco
Silvio Lattanzi
A. Norouzi-Fard
Morteza Zadimoghaddam
76
9
0
31 May 2023
1