{"total":21,"rows":[{"id":"2301.13326","title":"A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2302.01324","title":"Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback","created":"2023-02-02","cited_by_count":19,"area":null},{"id":"2104.01750","title":"Optimal Sampling Gaps for Adaptive Submodular Maximization","created":"2021-04-05","cited_by_count":9,"area":null},{"id":"2102.08327","title":"Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity","created":"2021-02-16","cited_by_count":8,"area":null},{"id":"2104.04853","title":"Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and $k$-System Constraints","created":"2021-04-10","cited_by_count":8,"area":null},{"id":"2201.13128","title":"Deletion Robust Submodular Maximization over Matroids","created":"2022-01-31","cited_by_count":7,"area":null},{"id":"2305.19918","title":"Fully Dynamic Submodular Maximization over Matroids","created":"2023-05-31","cited_by_count":7,"area":null},{"id":"2207.03364","title":"Group Equality in Adaptive Submodular Maximization","created":"2022-07-07","cited_by_count":5,"area":null},{"id":"2305.10292","title":"Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint","created":"2023-05-17","cited_by_count":5,"area":null},{"id":"2107.11333","title":"Robust Adaptive Submodular Maximization","created":"2021-07-23","cited_by_count":4,"area":null},{"id":"2207.12840","title":"Partial-Monotone Adaptive Submodular Maximization","created":"2022-07-26","cited_by_count":2,"area":null},{"id":"2208.07582","title":"Deletion Robust Non-Monotone Submodular Maximization over Matroids","created":"2022-08-16","cited_by_count":2,"area":null},{"id":"2308.08641","title":"Non-monotone Sequential Submodular Maximization","created":"2023-08-16","cited_by_count":2,"area":null},{"id":"2405.19977","title":"Consistent Submodular Maximization","created":"2024-05-30","cited_by_count":2,"area":null},{"id":"2111.00986","title":"Partial-Adaptive Submodular Maximization","created":"2021-11-01","cited_by_count":1,"area":null},{"id":"2308.10656","title":"Practical Parallel Algorithms for Non-Monotone Submodular Maximization","created":"2023-08-21","cited_by_count":1,"area":null},{"id":"2606.04946","title":"A General Framework for Dynamic Consistent Submodular Maximization","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2304.06048","title":"RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization","created":"2023-04-11","cited_by_count":0,"area":null},{"id":"2404.01930","title":"Adaptive Combinatorial Maximization: Beyond Approximate Greedy Policies","created":"2024-04-02","cited_by_count":0,"area":null},{"id":"2405.12252","title":"Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity","created":"2024-05-20","cited_by_count":0,"area":null},{"id":"2409.04415","title":"Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint","created":"2024-09-06","cited_by_count":0,"area":null}],"next_cursor":null}