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

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel NIPS 2021
Sample Efficient Decentralized Stochastic Frank-Wolfe Methods for Continuous DR-Submodular Maximization IJCAI 2021
Differentiable Greedy Algorithm for Monotone Submodular Maximization: Guarantees, Gradient Estimators, and Applications AISTATS 2021
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time AISTATS 2021
Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints AISTATS 2021
Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee AAAI 2021
Differentially Private Online Submodular Maximization AISTATS 2021
Tracking Regret Bounds for Online Submodular Optimization AISTATS 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity ICML 2021
Instance Specific Approximations for Submodular Maximization ICML 2021
Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization JMLR 2020
Parallel Algorithm for Non-Monotone DR-Submodular Maximization ICML 2020
“Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020
Streaming Submodular Maximization under a k-Set System Constraint ICML 2020
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints AISTATS 2020
Mining Topological Structure in Graphs through Forest Representations JMLR 2020
Adaptive Submodular Maximization under Stochastic Item Costs COLT 2020
The FAST Algorithm for Submodular Maximization ICML 2020
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization JMLR 2020
Fast and Private Submodular and $k$-Submodular Functions Maximization with Matroid Constraints ICML 2020
Black Box Submodular Maximization: Discrete and Continuous Settings AISTATS 2020
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds NIPS 2020
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time NIPS 2020
Submodular Maximization Through Barrier Functions NIPS 2020
Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint AISTATS 2020