Quick Streaming Algorithms for Maximization of Monotone Submodular
Functions in Linear Time

v1v2v3 (latest)

Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time

10 September 2020

ArXiv (abs)PDF HTML

Papers citing "Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time"

7 / 7 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 56 0 0 06 Sep 2024
Practical $0.385$ -Approximation for Submodular Maximization Subject to a Cardinality Constraint M. Tukan Loay Mualem Moran Feldman 55 4 0 22 May 2024
Streaming Adaptive Submodular Maximization Shaojie Tang Jing Yuan 56 4 0 17 Aug 2022
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models Tonmoy Dey Yixing Chen Alan Kuhnle 61 0 0 20 Jun 2022
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel Yixin Chen Tonmoy Dey Alan Kuhnle 55 14 0 15 Nov 2021
Very Fast Streaming Submodular Function Maximization Sebastian Buschjäger Philipp-Jan Honysz Lukas Pfahler K. Morik 82 9 0 20 Oct 2020
Submodular Maximization in Clean Linear Time Wenxin Li Moran Feldman Ehsan Kazemi Amin Karbasi 46 23 0 16 Jun 2020