共 50 条
- [41] Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time 24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
- [43] Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization Theory of Computing Systems, 2022, 66 : 354 - 394
- [44] Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
- [45] Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016), 2016, 29
- [46] A Polynomial Lower Bound on Adaptive Complexity of Submodular Maximization PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 140 - 152
- [47] Adaptive Sampling for Fast Constrained Maximization of Submodular Functions 24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
- [49] An optimal streaming algorithm for non-submodular functions maximization on the integer lattice Journal of Combinatorial Optimization, 2023, 45
- [50] Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint 2022 IEEE 9TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA), 2022, : 260 - 269