conftrace_

submodular maximization

143 papers

Explore in graph

Co-occurring keywords

approximation algorithm (630) greedy algorithm (242) cardinality constraint (71) matroid constraint (50) combinatorial optimization (1039) streaming algorithm (131) regret bound (1926) approximation guarantee (65) knapsack constraint (26) submodular optimization (261)

Papers

Fairness in Streaming Submodular Maximization over a Matroid Constraint ICML 2023
Robust Sequence Networked Submodular Maximization AAAI 2023
Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023
Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments RSS 2023
Dynamic Non-monotone Submodular Maximization NIPS 2023
Improved Algorithm for Regret Ratio Minimization in Multi-Objective Submodular Maximization AAAI 2023
Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity AAAI 2023
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint IJCAI 2023
Fleet Active Learning: A Submodular Maximization Approach CORL 2023
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints AAAI 2023
Optimal Sampling Gaps for Adaptive Submodular Maximization AAAI 2022
Using Partial Monotonicity in Submodular Maximization NIPS 2022
An explore-then-commit algorithm for submodular maximization under full-bandit feedback UAI 2022
Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints ICML 2022
Efficient Submodular Optimization under Noise: Local Search is Robust NIPS 2022
Greedy modality selection via approximate submodular maximization UAI 2022
Budgeted Sequence Submodular Maximization IJCAI 2022
Deletion Robust Submodular Maximization over Matroids ICML 2022
Differentiable Greedy Algorithm for Monotone Submodular Maximization: Guarantees, Gradient Estimators, and Applications AISTATS 2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions AISTATS 2021
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time AISTATS 2021
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021
Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021
Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints AISTATS 2021
Cardinality constrained submodular maximization for random streams NIPS 2021