:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Li, Wenxin
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	https://arxiv.org/abs/2409.02943
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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)

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

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

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)

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

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

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

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

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)

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

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

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
par: Wan, Zongqi, et autres
Publié: (2024)

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

Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
par: Klimm, Max, et autres
Publié: (2022)

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

A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature
par: Gu, Xiang, et autres
Publié: (2026)

A Unified Approach to Submodular Maximization Under Noise
par: Bhawalkar, Kshipra, et autres
Publié: (2025)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
par: Tukan, Murad, et autres
Publié: (2024)

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

Minimum Cost Adaptive Submodular Cover
par: Al-Thani, Hessa, et autres
Publié: (2022)

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

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

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
par: Gopal, Shivaram, et autres
Publié: (2024)

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

Decomposable Submodular Maximization in Federated Setting
par: Rafiey, Akbar
Publié: (2024)

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

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
par: Hao, Yimin, et autres
Publié: (2025)

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)

Submodular Maximization in Exactly $n$ Queries
par: Balkanski, Eric, et autres
Publié: (2024)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
par: Buchbinder, Niv, et autres
Publié: (2025)

A Poisson Process for Submodular Maximization
par: Rozenman, Amit Ganz, et autres
Publié: (2026)

Deterministic Coreset for Lp Subspace
par: Chhaya, Rachit, et autres
Publié: (2026)

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

Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
par: Chen, Yixin, et autres
Publié: (2022)

Regularized Unconstrained Weakly Submodular Maximization
par: Zhu, Yanhui, et autres
Publié: (2024)