Best of Both Worlds: Practical and Theoretically Optimal Submodular
Maximization in Parallel

v1v2 (latest)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel

15 November 2021

ArXiv (abs)PDF HTML

Papers citing "Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel"

7 / 7 papers shown

Title
Improving Robustness to Model Inversion Attacks via Sparse Coding Architectures S. V. Dibbo Adam Breuer Juston S. Moore Michael Teti AAML 85 5 0 21 Mar 2024
Practical Parallel Algorithms for Non-Monotone Submodular Maximization Shuang Cui Kai Han Jing Tang He Huang Xueying Li Aakas Zhiyuli Han Li 54 2 0 21 Aug 2023
RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization Yuanhang Shao Tonmoy Dey Nikola Vučković Luke Van Popering Alan Kuhnle 89 0 0 11 Apr 2023
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models Tonmoy Dey Yixing Chen Alan Kuhnle 74 0 0 20 Jun 2022
Lazy and Fast Greedy MAP Inference for Determinantal Point Process Shinichi Hemmi Taihei Oki Shinsaku Sakaue K. Fujii Satoru Iwata 40 4 0 13 Jun 2022
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 67 12 0 16 Feb 2021
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint Yixing Chen Alan Kuhnle 82 7 0 03 Sep 2020