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. 1706.04918
  4. Cited By
Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

15 June 2017
Ilija Bogunovic
Slobodan Mitrovic
Jonathan Scarlett
V. Cevher
ArXivPDFHTML

Papers citing "Robust Submodular Maximization: A Non-Uniform Partitioning Approach"

12 / 12 papers shown
Title
Fair Submodular Cover
Fair Submodular Cover
Wenjing Chen
Shuo Xing
Samson Zhou
Victoria G. Crawford
35
2
0
05 Jul 2024
Localized Distributional Robustness in Submodular Multi-Task Subset
  Selection
Localized Distributional Robustness in Submodular Multi-Task Subset Selection
Ege C. Kaya
Abolfazl Hashemi
24
2
0
04 Apr 2024
Robust Sequence Networked Submodular Maximization
Robust Sequence Networked Submodular Maximization
Qihao Shi
Bingyang Fu
C. Wang
Jiawei Chen
Sheng Zhou
Yan Feng
Chun-Yen Chen
13
0
0
28 Dec 2022
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
Learning for Robust Combinatorial Optimization: Algorithm and
  Application
Learning for Robust Combinatorial Optimization: Algorithm and Application
Zhihui Shao
Jianyi Yang
Cong Shen
Shaolei Ren
38
6
0
20 Dec 2021
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
"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
Running Time Analysis of the (1+1)-EA for Robust Linear Optimization
Running Time Analysis of the (1+1)-EA for Robust Linear Optimization
Chao Bian
Chao Qian
K. Tang
Yang Yu
21
8
0
17 Jun 2019
Distributionally Robust Submodular Maximization
Distributionally Robust Submodular Maximization
Matthew Staib
Bryan Wilder
Stefanie Jegelka
25
35
0
14 Feb 2018
Robust Influence Maximization
Robust Influence Maximization
Wei Chen
Tian Lin
Zihan Tan
Mingfei Zhao
Xuren Zhou
48
169
0
25 Jan 2016
1