Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity

16 February 2021

Papers citing "Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity"

6 / 6 papers shown

Title
Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity Canh V. Pham 27 1 0 20 May 2024
Practical Parallel Algorithms for Non-Monotone Submodular Maximization Shuang Cui Kai Han Jing Tang He Huang Xueying Li Aakas Zhiyuli Han Li 27 2 0 21 Aug 2023
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 Paul Dutting Federico Fusco Silvio Lattanzi A. Norouzi-Fard Morteza Zadimoghaddam 43 15 0 31 Jan 2022
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint Georgios Amanatidis Federico Fusco Philip Lazos S. Leonardi Rebecca Reiffenhauser 13 46 0 09 Jul 2020
Submodular Maximization Through Barrier Functions Ashwinkumar Badanidiyuru Amin Karbasi Ehsan Kazemi J. Vondrák 40 17 0 10 Feb 2020