Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

9 July 2020

Papers citing "Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint"

9 / 9 papers shown

Title
Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity Canh V. Pham 29 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
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback G. Nie Yididiya Y. Nadew Yanhui Zhu Vaneet Aggarwal Christopher J. Quinn OffRL 9 13 0 30 Jan 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
Partial-Adaptive Submodular Maximization Shaojie Tang Jing Yuan OffRL 18 1 0 01 Nov 2021
Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and $k$ -System Constraints Shaojie Tang 21 12 0 10 Apr 2021
Optimal Sampling Gaps for Adaptive Submodular Maximization Shaojie Tang Jing Yuan 24 10 0 05 Apr 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