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. 1711.02598
  4. Cited By
Streaming Robust Submodular Maximization: A Partitioned Thresholding
  Approach

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

7 November 2017
Slobodan Mitrovic
Ilija Bogunovic
A. Norouzi-Fard
Jakub Tarnawski
V. Cevher
ArXivPDFHTML

Papers citing "Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach"

9 / 9 papers shown
Title
Fair Submodular Cover
Fair Submodular Cover
Wenjing Chen
Shuo Xing
Samson Zhou
Victoria G. Crawford
35
2
0
05 Jul 2024
Provable Robustness for Streaming Models with a Sliding Window
Provable Robustness for Streaming Models with a Sliding Window
Aounon Kumar
Vinu Sankar Sadasivan
S. Feizi
OOD
AAML
AI4TS
19
1
0
28 Mar 2023
Deletion Robust Non-Monotone Submodular Maximization over Matroids
Deletion Robust Non-Monotone Submodular Maximization over Matroids
Paul Dutting
Federico Fusco
Silvio Lattanzi
A. Norouzi-Fard
Morteza Zadimoghaddam
29
3
0
16 Aug 2022
Deletion Robust Submodular Maximization over Matroids
Deletion Robust Submodular Maximization over Matroids
Paul Dutting
Federico Fusco
Silvio Lattanzi
A. Norouzi-Fard
Morteza Zadimoghaddam
41
15
0
31 Jan 2022
Minimax Optimization: The Case of Convex-Submodular
Minimax Optimization: The Case of Convex-Submodular
Arman Adibi
Aryan Mokhtari
Hamed Hassani
21
7
0
01 Nov 2021
Adversarial Robustness of Streaming Algorithms through Importance
  Sampling
Adversarial Robustness of Streaming Algorithms through Importance Sampling
Vladimir Braverman
Avinatan Hassidim
Yossi Matias
Mariano Schain
Sandeep Silwal
Samson Zhou
AAML
OOD
24
38
0
28 Jun 2021
Fair and Representative Subset Selection from Data Streams
Fair and Representative Subset Selection from Data Streams
Yanhao Wang
Francesco Fabbri
M. Mathioudakis
11
0
0
09 Oct 2020
"Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for
  Submodular Knapsack
"Bring Your Own Greedy"+Max: Near-Optimal 1/21/21/2-Approximations for Submodular Knapsack
Dmitrii Avdiukhin
G. Yaroslavtsev
Samson Zhou
14
35
0
12 Oct 2019
Robust Influence Maximization
Robust Influence Maximization
Wei Chen
Tian Lin
Zihan Tan
Mingfei Zhao
Xuren Zhou
48
169
0
25 Jan 2016
1