ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.03523
  4. Cited By
Submodular Maximization Through Barrier Functions

Submodular Maximization Through Barrier Functions

Neural Information Processing Systems (NeurIPS), 2020
10 February 2020
Ashwinkumar Badanidiyuru
Amin Karbasi
Ehsan Kazemi
J. Vondrák
ArXiv (abs)PDFHTML

Papers citing "Submodular Maximization Through Barrier Functions"

8 / 8 papers shown
Greedy selection of optimal location of sensors for uncertainty
  reduction in seismic moment tensor inversion
Greedy selection of optimal location of sensors for uncertainty reduction in seismic moment tensor inversion
B. M. Dia
Michael Fehler
S. Kaka
A. Scarinci
U. Waheed
Chen Gu
234
3
0
03 Mar 2024
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
Shuang Cui
Kai Han
Jing Tang
He Huang
Xueying Li
Aakas Zhiyuli
Han Li
228
1
0
21 Aug 2023
Submodular Maximization under the Intersection of Matroid and Knapsack
  Constraints
Submodular Maximization under the Intersection of Matroid and Knapsack ConstraintsAAAI Conference on Artificial Intelligence (AAAI), 2023
Yuzhou Gu
Chao Bian
Chao Qian
266
5
0
18 Jul 2023
Lyapunov function approach for approximation algorithm design and
  analysis: with applications in submodular maximization
Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization
D. Du
411
12
0
25 May 2022
The Power of Subsampling in Submodular Maximization
The Power of Subsampling in Submodular MaximizationMathematics of Operations Research (MOR), 2021
Christopher Harshaw
Ehsan Kazemi
Moran Feldman
Amin Karbasi
279
9
0
06 Apr 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial
  Algorithms with Near-optimal Adaptive Complexity
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive ComplexityInternational Conference on Machine Learning (ICML), 2021
Georgios Amanatidis
Federico Fusco
Philip Lazos
S. Leonardi
A. M. Spaccamela
Rebecca Reiffenhauser
273
16
0
16 Feb 2021
Submodular Maximization in Clean Linear Time
Submodular Maximization in Clean Linear Time
Wenxin Li
Moran Feldman
Ehsan Kazemi
Amin Karbasi
539
25
0
16 Jun 2020
Streaming Submodular Maximization under a $k$-Set System Constraint
Streaming Submodular Maximization under a kkk-Set System ConstraintInternational Conference on Machine Learning (ICML), 2020
Ran Haba
Ehsan Kazemi
Moran Feldman
Amin Karbasi
236
43
0
09 Feb 2020
1
Page 1 of 1