ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2111.03198
  4. Cited By
On the Complexity of Dynamic Submodular Maximization

On the Complexity of Dynamic Submodular Maximization

5 November 2021
Xi Chen
Binghui Peng
ArXivPDFHTML

Papers citing "On the Complexity of Dynamic Submodular Maximization"

4 / 4 papers shown
Title
The Cost of Consistency: Submodular Maximization with Constant Recourse
The Cost of Consistency: Submodular Maximization with Constant Recourse
Paul Dutting
Federico Fusco
Silvio Lattanzi
A. Norouzi-Fard
O. Svensson
Morteza Zadimoghaddam
75
0
0
03 Dec 2024
A Dynamic Algorithm for Weighted Submodular Cover Problem
A Dynamic Algorithm for Weighted Submodular Cover Problem
Kiarash Banihashem
Samira Goudarzi
Mohammadtaghi Hajiaghayi
Peyman Jabbarzade
M. Monemizadeh
32
0
0
13 Jul 2024
Dynamic Non-monotone Submodular Maximization
Dynamic Non-monotone Submodular Maximization
Kiarash Banihashem
Leyla Biabani
Samira Goudarzi
Mohammadtaghi Hajiaghayi
Peyman Jabbarzade
M. Monemizadeh
30
2
0
07 Nov 2023
Fully Dynamic Submodular Maximization over Matroids
Fully Dynamic Submodular Maximization over Matroids
Paul Dutting
Federico Fusco
Silvio Lattanzi
A. Norouzi-Fard
Morteza Zadimoghaddam
31
9
0
31 May 2023
1