Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1811.06603
Cited By
Unconstrained Submodular Maximization with Constant Adaptive Complexity
15 November 2018
Lin Chen
Moran Feldman
Amin Karbasi
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Unconstrained Submodular Maximization with Constant Adaptive Complexity"
18 / 18 papers shown
Title
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint
Tan D. Tran
Canh V. Pham
Dung T. K. Ha
Phuong N. H. Pham
33
0
0
06 Sep 2024
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
Shuang Cui
Kai Han
Jing Tang
He Huang
Xueying Li
Aakas Zhiyuli
Han Li
30
2
0
21 Aug 2023
Submodular + Concave
Siddharth Mitra
Moran Feldman
Amin Karbasi
11
18
0
09 Jun 2021
Parallelizing Thompson Sampling
Amin Karbasi
Vahab Mirrokni
M. Shadravan
54
23
0
02 Jun 2021
Scalable Projection-Free Optimization
Mingrui Zhang
28
0
0
07 May 2021
Instance Specific Approximations for Submodular Maximization
Eric Balkanski
Sharon Qian
Yaron Singer
18
7
0
23 Feb 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Georgios Amanatidis
Federico Fusco
Philip Lazos
S. Leonardi
A. M. Spaccamela
Rebecca Reiffenhauser
41
12
0
16 Feb 2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Function
Francesco Quinzan
Vanja Doskoc
Andreas Göbel
Tobias Friedrich
12
5
0
12 Feb 2021
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
Yixing Chen
Alan Kuhnle
8
7
0
03 Sep 2020
Continuous Submodular Maximization: Beyond DR-Submodularity
Moran Feldman
Amin Karbasi
14
5
0
21 Jun 2020
A polynomial lower bound on adaptive complexity of submodular maximization
Wenzheng Li
Paul Liu
J. Vondrák
9
10
0
21 Feb 2020
Adaptivity in Adaptive Submodularity
Hossein Esfandiari
Amin Karbasi
Vahab Mirrokni
26
34
0
09 Nov 2019
Regret Bounds for Batched Bandits
Hossein Esfandiari
Amin Karbasi
Abbas Mehrabian
Vahab Mirrokni
20
61
0
11 Oct 2019
One Sample Stochastic Frank-Wolfe
Mingrui Zhang
Zebang Shen
Aryan Mokhtari
Hamed Hassani
Amin Karbasi
12
57
0
10 Oct 2019
The FAST Algorithm for Submodular Maximization
Adam Breuer
Eric Balkanski
Yaron Singer
11
32
0
14 Jul 2019
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
Ehsan Kazemi
Marko Mitrovic
Morteza Zadimoghaddam
Silvio Lattanzi
Amin Karbasi
21
89
0
02 May 2019
Fast Parallel Algorithms for Statistical Subset Selection Problems
Sharon Qian
Yaron Singer
20
8
0
06 Mar 2019
A Parallel Double Greedy Algorithm for Submodular Maximization
Alina Ene
Huy Le Nguyen
Adrian Vladu
16
11
0
04 Dec 2018
1