:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Auletta, Vincenzo, Ferraioli, Diodato, Vinci, Cosimo
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Artificial Intelligence
Accès en ligne:	https://arxiv.org/abs/2404.13737
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
par: Nguyen, Hue T., et autres
Publié: (2025)

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

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

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

Adaptive Multi-Round Allocation with Stochastic Arrivals
par: Pan, Yuqi, et autres
Publié: (2026)

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

Covering a Few Submodular Constraints and Applications
par: Bajpai, Tanvi, et autres
Publié: (2025)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
par: Benomar, Ziyad, et autres
Publié: (2025)

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

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

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
par: Wang, Long, et autres
Publié: (2025)

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
par: Bilò, Vittorio, et autres
Publié: (2025)

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

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

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

Streaming Stochastic Submodular Maximization with On-Demand User Requests
par: Wang, Honglian, et autres
Publié: (2026)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
par: Wang, Chenhao
Publié: (2025)

Submodular Order Functions and Assortment Optimization
par: Udwani, Rajan
Publié: (2021)

Monotone Submodular Multiway Partition
par: Bi, Richard, et autres
Publié: (2024)

The Online Submodular Assignment Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

The Submodular Santa Claus Problem
par: Bamas, Etienne, et autres
Publié: (2024)

The Online Submodular Assignment Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

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

Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
par: Fang, Qiangpeng, et autres
Publié: (2026)

Efficient Detection of Exchangeable Factors in Factor Graphs
par: Luttermann, Malte, et autres
Publié: (2024)

Masked Matrix Multiplication for Emergent Sparsity
par: Wheatman, Brian, et autres
Publié: (2024)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
par: Chaudhary, Juhi, et autres
Publié: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
par: la Tour, Max Dupré, et autres
Publié: (2024)

Lifted Causal Inference in Relational Domains
par: Luttermann, Malte, et autres
Publié: (2024)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
par: Shimoda, Takumi, et autres
Publié: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
par: Luo, Chunyu, et autres
Publié: (2024)

An Invertible State Space for Process Trees
par: Kolhof, Gero, et autres
Publié: (2024)

Approximating Optimal Labelings for Temporal Connectivity
par: Carnevale, Daniele, et autres
Publié: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
par: Almansoori, Mahmood K. M., et autres
Publié: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
par: Liu, Ruipeng, et autres
Publié: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
par: Mitzenmacher, Michael, et autres
Publié: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
par: Han, Yue, et autres
Publié: (2025)

Knapsack: Connectedness, Path, and Shortest-Path
par: Dey, Palash, et autres
Publié: (2023)

Online Allocation with Unknown Shared Supply
par: Neoh, Tzeh Yuan, et autres
Publié: (2026)