knapsack constraint

Fair Submodular Maximization over a Knapsack Constraint IJCAI 2025 Improved Approximation Algorithms for k-Submodular Maximization via Multilinear Extension ICLR 2025 Online and Streaming Algorithms for Constrained k-Submodular Maximization AAAI 2025 On Preference-based Stochastic Linear Contextual Bandits with Knapsacks AISTATS 2025 On Stochastic Contextual Bandits with Knapsacks in Small Budget Regime ICLR 2025 Deletion-Robust Submodular Maximization with Knapsack Constraints AAAI 2024 High-dimensional Linear Bandits with Knapsacks ICML 2024 Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint IJCAI 2024 A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback ICML 2023 Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression COLT 2023 Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint IJCAI 2023 Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity AAAI 2023 Submodular Maximization under the Intersection of Matroid and Knapsack Constraints AAAI 2023 Dependent randomized rounding for clustering and partition systems with knapsack constraints JMLR 2022 Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022 Submodular Maximization in Clean Linear Time NeurIPS 2022 Constrained Robust Submodular Partitioning NeurIPS 2021 Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints AISTATS 2021 Efficient Reinforcement Learning in Factored MDPs with Application to Constrained RL ICLR 2021 Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity ICML 2021 “Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020 Dependent randomized rounding for clustering and partition systems with knapsack constraints AISTATS 2020 Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NeurIPS 2020 Submodular Bandit Problem Under Multiple Constraints UAI 2020 Submodular Maximization Through Barrier Functions NeurIPS 2020