A Note On Deterministic Submodular Maximization With Bounded Curvature
Fuente:
arXiv
Guardado en:
| Autor principal: | Li, Wenxin |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Consistent Submodular Maximization
por: Dütting, Paul, et al.
Publicado: (2024)
por: Dütting, Paul, et al.
Publicado: (2024)
Linear Submodular Maximization with Bandit Feedback
por: Chen, Wenjing, et al.
Publicado: (2024)
por: Chen, Wenjing, et al.
Publicado: (2024)
Online Two-Stage Submodular Maximization
por: Nikolaou, Iasonas, et al.
Publicado: (2025)
por: Nikolaou, Iasonas, et al.
Publicado: (2025)
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
por: Cui, Shuang, et al.
Publicado: (2023)
por: Cui, Shuang, et al.
Publicado: (2023)
The Cost of Consistency: Submodular Maximization with Constant Recourse
por: Dütting, Paul, et al.
Publicado: (2024)
por: Dütting, Paul, et al.
Publicado: (2024)
Deletion Robust Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2022)
por: Dütting, Paul, et al.
Publicado: (2022)
Fully Dynamic Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2023)
por: Dütting, Paul, et al.
Publicado: (2023)
Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
por: Chen, Yixin, et al.
Publicado: (2026)
por: Chen, Yixin, et al.
Publicado: (2026)
The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
por: Yuan, Jing, et al.
Publicado: (2024)
por: Yuan, Jing, et al.
Publicado: (2024)
Deletion Robust Non-Monotone Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2022)
por: Dütting, Paul, et al.
Publicado: (2022)
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
por: Chen, Yixin, et al.
Publicado: (2020)
por: Chen, Yixin, et al.
Publicado: (2020)
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
por: Chen, Yixin, et al.
Publicado: (2021)
por: Chen, Yixin, et al.
Publicado: (2021)
Mini-batch Submodular Maximization
por: Schwartzman, Gregory
Publicado: (2024)
por: Schwartzman, Gregory
Publicado: (2024)
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
por: Amanatidis, Georgios, et al.
Publicado: (2020)
por: Amanatidis, Georgios, et al.
Publicado: (2020)
Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
por: Wan, Zongqi, et al.
Publicado: (2024)
por: Wan, Zongqi, et al.
Publicado: (2024)
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
por: Amanatidis, Georgios, et al.
Publicado: (2021)
por: Amanatidis, Georgios, et al.
Publicado: (2021)
Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
por: Klimm, Max, et al.
Publicado: (2022)
por: Klimm, Max, et al.
Publicado: (2022)
Fairness in Streaming Submodular Maximization over a Matroid Constraint
por: Halabi, Marwa El, et al.
Publicado: (2023)
por: Halabi, Marwa El, et al.
Publicado: (2023)
A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature
por: Gu, Xiang, et al.
Publicado: (2026)
por: Gu, Xiang, et al.
Publicado: (2026)
Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
por: Chen, Yixin, et al.
Publicado: (2024)
por: Chen, Yixin, et al.
Publicado: (2024)
Minimum Cost Adaptive Submodular Cover
por: Al-Thani, Hessa, et al.
Publicado: (2022)
por: Al-Thani, Hessa, et al.
Publicado: (2022)
A Dynamic Algorithm for Weighted Submodular Cover Problem
por: Banihashem, Kiarash, et al.
Publicado: (2024)
por: Banihashem, Kiarash, et al.
Publicado: (2024)
Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
por: Tukan, Murad, et al.
Publicado: (2024)
por: Tukan, Murad, et al.
Publicado: (2024)
Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
por: Harris, Blake, et al.
Publicado: (2024)
por: Harris, Blake, et al.
Publicado: (2024)
Multi-Agent Reinforcement Learning with Submodular Reward
por: Chen, Wenjing, et al.
Publicado: (2026)
por: Chen, Wenjing, et al.
Publicado: (2026)
A Unified Approach to Submodular Maximization Under Noise
por: Bhawalkar, Kshipra, et al.
Publicado: (2025)
por: Bhawalkar, Kshipra, et al.
Publicado: (2025)
Stochastic $k$-Submodular Bandits with Full Bandit Feedback
por: Nie, Guanyu, et al.
Publicado: (2024)
por: Nie, Guanyu, et al.
Publicado: (2024)
Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
por: Hao, Yimin, et al.
Publicado: (2025)
por: Hao, Yimin, et al.
Publicado: (2025)
Submodular Maximization in Exactly $n$ Queries
por: Balkanski, Eric, et al.
Publicado: (2024)
por: Balkanski, Eric, et al.
Publicado: (2024)
Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
por: Buchbinder, Niv, et al.
Publicado: (2025)
por: Buchbinder, Niv, et al.
Publicado: (2025)
A Poisson Process for Submodular Maximization
por: Rozenman, Amit Ganz, et al.
Publicado: (2026)
por: Rozenman, Amit Ganz, et al.
Publicado: (2026)
GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
por: Fahrbach, Matthew, et al.
Publicado: (2024)
por: Fahrbach, Matthew, et al.
Publicado: (2024)
GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
por: Gopal, Shivaram, et al.
Publicado: (2024)
por: Gopal, Shivaram, et al.
Publicado: (2024)
Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems
por: Harb, Elfarouk, et al.
Publicado: (2025)
por: Harb, Elfarouk, et al.
Publicado: (2025)
Fair Submodular Cover
por: Chen, Wenjing, et al.
Publicado: (2024)
por: Chen, Wenjing, et al.
Publicado: (2024)
Deterministic Coreset for Lp Subspace
por: Chhaya, Rachit, et al.
Publicado: (2026)
por: Chhaya, Rachit, et al.
Publicado: (2026)
Regularized Unconstrained Weakly Submodular Maximization
por: Zhu, Yanhui, et al.
Publicado: (2024)
por: Zhu, Yanhui, et al.
Publicado: (2024)
Learning-Augmented Dynamic Submodular Maximization
por: Agarwal, Arpit, et al.
Publicado: (2023)
por: Agarwal, Arpit, et al.
Publicado: (2023)
Decomposable Submodular Maximization in Federated Setting
por: Rafiey, Akbar
Publicado: (2024)
por: Rafiey, Akbar
Publicado: (2024)
Fair Submodular Maximization over a Knapsack Constraint
por: Li, Lijun, et al.
Publicado: (2025)
por: Li, Lijun, et al.
Publicado: (2025)
Ejemplares similares
-
Consistent Submodular Maximization
por: Dütting, Paul, et al.
Publicado: (2024) -
Linear Submodular Maximization with Bandit Feedback
por: Chen, Wenjing, et al.
Publicado: (2024) -
Online Two-Stage Submodular Maximization
por: Nikolaou, Iasonas, et al.
Publicado: (2025) -
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
por: Cui, Shuang, et al.
Publicado: (2023) -
The Cost of Consistency: Submodular Maximization with Constant Recourse
por: Dütting, Paul, et al.
Publicado: (2024)