Image de couverture de livre

A Learning Perspective on Random-Order Covering Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gupta, Anupam, Molinaro, Marco, Russo, Matteo
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Random Order Set Cover is as Easy as Offline
par: Gupta, Anupam, et autres
Publié: (2021)

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

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

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
par: Kesselheim, Thomas, et autres
Publié: (2025)

Online Learning in the Random Order Model
par: Bernasconi, Martino, et autres
Publié: (2025)

Steiner Forest: A Simplified Better-Than-2 Approximation
par: Gupta, Anupam, et autres
Publié: (2025)

Supermodular Approximation of Norms and Applications
par: Kesselheim, Thomas, et autres
Publié: (2024)

The Power of Migrations in Dynamic Bin Packing
par: Mellou, Konstantina, et autres
Publié: (2024)

Learning-Augmented Online Covering Problems
par: Ameli, Afrouz Jabal, et autres
Publié: (2025)

Random-Order Interval Selection
par: Borodin, Allan, et autres
Publié: (2024)

Pairwise-Independent Contention Resolution
par: Gupta, Anupam, et autres
Publié: (2024)

A Little Clairvoyance Is All You Need
par: Gupta, Anupam, et autres
Publié: (2025)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
par: Gupta, Anupam, et autres
Publié: (2026)

Expanderizing Higher Order Random Walks
par: Alev, Vedat Levi, et autres
Publié: (2024)

Tree Coloring: Random Order and Predictions
par: Frei, Fabian, et autres
Publié: (2024)

Generalized Assignment and Knapsack Problems in the Random-Order Model
par: Klimm, Max, et autres
Publié: (2025)

Lipschitz Continuous Algorithms for Covering Problems
par: Kumabe, Soh, et autres
Publié: (2023)

Approximating the Top Eigenvector in Random Order Streams
par: Kacham, Praneeth, et autres
Publié: (2024)

Unit Interval Selection in Random Order Streams
par: Alexandru, Cezar-Mihail, et autres
Publié: (2026)

Online Disjoint Set Covers: Randomization is not Necessary
par: Bienkowski, Marcin, et autres
Publié: (2024)

Simple and Optimal Sublinear Algorithms for Mean Estimation
par: Bertolotti, Beatrice, et autres
Publié: (2024)

Why is My Route Different Today? An Algorithm for Explaining Route Selection
par: Schild, Aaron, et autres
Publié: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
par: Madani, Amirali, et autres
Publié: (2025)

Weighted Matching in the Random-Order Streaming and Robust Communication Models
par: Hashemi, Diba, et autres
Publié: (2024)

Matroid-Based TSP Rounding for Half-Integral Solutions
par: Gupta, Anupam, et autres
Publié: (2021)

Bin Packing under Random-Order: Breaking the Barrier of 3/2
par: Hebbar, Anish, et autres
Publié: (2024)

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
par: Buchbinder, Niv, et autres
Publié: (2026)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
par: Grandoni, Fabrizio, et autres
Publié: (2026)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
par: Bhore, Sujoy, et autres
Publié: (2026)

Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming
par: Samanta, Sukanya, et autres
Publié: (2025)

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
par: Ezra, Tomer, et autres
Publié: (2024)

Maximizing the Margin between Desirable and Undesirable Elements in a Covering Problem
par: Boileau, Sophie, et autres
Publié: (2025)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
par: Tayal, Mumuksh
Publié: (2025)

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
par: Baswana, Surender, et autres
Publié: (2025)

Complexity of Local Search for CSPs Parameterized by Constraint Difference
par: Anand, Aditya, et autres
Publié: (2025)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
par: Nguyen, Ta Duy, et autres
Publié: (2024)

The Average-Value Allocation Problem
par: Bhawalkar, Kshipra, et autres
Publié: (2024)

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
par: Babatunde, Abiola, et autres
Publié: (2026)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
par: Burathep, Kunanon, et autres
Publié: (2025)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
par: Lovig, Maxwell, et autres
Publié: (2024)