Image de couverture de livre

Minimum Cost Adaptive Submodular Cover

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Al-Thani, Hessa, Cui, Yubing, Nagarajan, Viswanath
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Identifying Approximate Minimizers under Stochastic Uncertainty
par: Al-Thani, Hessa, et autres
Publié: (2025)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
par: Harris, Blake, et autres
Publié: (2024)

A Simple Approximation Algorithm for Optimal Decision Tree
par: Zhuo, Zhengjia, et autres
Publié: (2025)

Semi-Bandit Learning for Monotone Stochastic Optimization
par: Agarwal, Arpit, et autres
Publié: (2023)

The Cost of Consistency: Submodular Maximization with Constant Recourse
par: Dütting, Paul, et autres
Publié: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
par: Banihashem, Kiarash, et autres
Publié: (2024)

Sequential Testing with Subadditive Costs
par: Harris, Blake, et autres
Publié: (2025)

Fair Submodular Cover
par: Chen, Wenjing, et autres
Publié: (2024)

Minimum-Cost Network Flow with Dual Predictions
par: Chen, Zhiyang, et autres
Publié: (2026)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
par: Cui, Shuang, et autres
Publié: (2023)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
par: Amanatidis, Georgios, et autres
Publié: (2020)

Consistent Submodular Maximization
par: Dütting, Paul, et autres
Publié: (2024)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
par: Amanatidis, Georgios, et autres
Publié: (2021)

Distributionally Robust $k$-of-$n$ Sequential Testing
par: Tan, Rayen, et autres
Publié: (2026)

Linear Submodular Maximization with Bandit Feedback
par: Chen, Wenjing, et autres
Publié: (2024)

Online Two-Stage Submodular Maximization
par: Nikolaou, Iasonas, et autres
Publié: (2025)

Deletion Robust Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2022)

Fully Dynamic Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2023)

Multi-Agent Reinforcement Learning with Submodular Reward
par: Chen, Wenjing, et autres
Publié: (2026)

A Note On Deterministic Submodular Maximization With Bounded Curvature
par: Li, Wenxin
Publié: (2024)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
par: Nie, Guanyu, et autres
Publié: (2024)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2022)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
par: Chen, Yixin, et autres
Publié: (2026)

The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
par: Yuan, Jing, et autres
Publié: (2024)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
par: Chen, Yixin, et autres
Publié: (2020)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
par: Chen, Yixin, et autres
Publié: (2021)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
par: Fahrbach, Matthew, et autres
Publié: (2024)

Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems
par: Harb, Elfarouk, et autres
Publié: (2025)

Mini-batch Submodular Maximization
par: Schwartzman, Gregory
Publié: (2024)

Discrete and Continuous Difference of Submodular Minimization
par: Orfanides, George, et autres
Publié: (2025)

The Online Submodular Cover Problem
par: Gupta, Anupam, et autres
Publié: (2025)

Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints
par: Laber, Eduardo S., et autres
Publié: (2024)

Query-decision Regression between Shortest Path and Minimum Steiner Tree
par: Tong, Guangmo, et autres
Publié: (2024)

The Cost of Parallelizing Boosting
par: Lyu, Xin, et autres
Publié: (2024)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
par: Pedramfar, Mohammad, et autres
Publié: (2023)

Fairness in Streaming Submodular Maximization over a Matroid Constraint
par: Halabi, Marwa El, et autres
Publié: (2023)

Fully-Dynamic Submodular Cover with Bounded Recourse
par: Gupta, Anupam, et autres
Publié: (2020)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
par: Chen, Yixin, et autres
Publié: (2024)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
par: Zhu, Yanhui, et autres
Publié: (2024)

Optimal Clustering with Dependent Costs in Bayesian Networks
par: Wu, Paul Pao-Yen, et autres
Publié: (2023)