Imagen de Portada

Stochastic Multi-round Submodular Optimization with Budget

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Auletta, Vincenzo, Ferraioli, Diodato, Vinci, Cosimo
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
por: Nguyen, Hue T., et al.
Publicado: (2025)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
por: Pedramfar, Mohammad, et al.
Publicado: (2023)

Adaptive Multi-Round Allocation with Stochastic Arrivals
por: Pan, Yuqi, et al.
Publicado: (2026)

Mini-batch Submodular Maximization
por: Schwartzman, Gregory
Publicado: (2024)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
por: Pham, Canh V.
Publicado: (2024)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
por: Harris, Blake, et al.
Publicado: (2024)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
por: Benomar, Ziyad, et al.
Publicado: (2025)

Covering a Few Submodular Constraints and Applications
por: Bajpai, Tanvi, et al.
Publicado: (2025)

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
por: Udwani, Rajan
Publicado: (2024)

Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
por: Tacheny, Nicolas
Publicado: (2026)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
por: Wang, Long, et al.
Publicado: (2025)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
por: Buchbinder, Niv, et al.
Publicado: (2025)

Decomposable Submodular Maximization in Federated Setting
por: Rafiey, Akbar
Publicado: (2024)

Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
por: Fang, Qiangpeng, et al.
Publicado: (2026)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
por: Nie, Guanyu, et al.
Publicado: (2024)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
por: Wang, Honglian, et al.
Publicado: (2026)

Monotone Submodular Multiway Partition
por: Bi, Richard, et al.
Publicado: (2024)

The Online Submodular Assignment Problem
por: Hathcock, Daniel, et al.
Publicado: (2024)

The Submodular Santa Claus Problem
por: Bamas, Etienne, et al.
Publicado: (2024)

The Online Submodular Assignment Problem
por: Hathcock, Daniel, et al.
Publicado: (2024)

The Online Submodular Cover Problem
por: Gupta, Anupam, et al.
Publicado: (2025)

Submodular Order Functions and Assortment Optimization
por: Udwani, Rajan
Publicado: (2021)

Submodular Maximization in Exactly $n$ Queries
por: Balkanski, Eric, et al.
Publicado: (2024)

Regularized Unconstrained Weakly Submodular Maximization
por: Zhu, Yanhui, et al.
Publicado: (2024)

Learning-Augmented Dynamic Submodular Maximization
por: Agarwal, Arpit, et al.
Publicado: (2023)

A Poisson Process for Submodular Maximization
por: Rozenman, Amit Ganz, et al.
Publicado: (2026)

Efficient Detection of Exchangeable Factors in Factor Graphs
por: Luttermann, Malte, et al.
Publicado: (2024)

Masked Matrix Multiplication for Emergent Sparsity
por: Wheatman, Brian, et al.
Publicado: (2024)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
por: Chaudhary, Juhi, et al.
Publicado: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
por: la Tour, Max Dupré, et al.
Publicado: (2024)

Lifted Causal Inference in Relational Domains
por: Luttermann, Malte, et al.
Publicado: (2024)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
por: Shimoda, Takumi, et al.
Publicado: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
por: Luo, Chunyu, et al.
Publicado: (2024)

An Invertible State Space for Process Trees
por: Kolhof, Gero, et al.
Publicado: (2024)

Approximating Optimal Labelings for Temporal Connectivity
por: Carnevale, Daniele, et al.
Publicado: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
por: Almansoori, Mahmood K. M., et al.
Publicado: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
por: Ganian, Robert, et al.
Publicado: (2025)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
por: Liu, Ruipeng, et al.
Publicado: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
por: Mitzenmacher, Michael, et al.
Publicado: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
por: Han, Yue, et al.
Publicado: (2025)