Imagen de Portada

Dynamic Pricing Algorithms for Online Set Cover

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bender, Max, Desai, Aum, He, Jialin, Thompson, Oliver, Upreti, Pramithas
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Engineering Algorithms for Dynamic Greedy Set Cover
por: Uzrad, Amitai
Publicado: (2026)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
por: Kesselheim, Thomas, et al.
Publicado: (2025)

Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
por: Solomon, Shay, et al.
Publicado: (2023)

Online Disjoint Set Covers: Randomization is not Necessary
por: Bienkowski, Marcin, et al.
Publicado: (2024)

Online Rounding for Set Cover under Subset Arrivals
por: Byrka, Jarosław, et al.
Publicado: (2025)

Dynamic Set Cover with Worst-Case Recourse
por: Solomon, Shay, et al.
Publicado: (2025)

A Lossless Deamortization for Dynamic Greedy Set Cover
por: Solomon, Shay, et al.
Publicado: (2024)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
por: Mitrović, Slobodan, et al.
Publicado: (2026)

A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
por: Bhangale, Amey, et al.
Publicado: (2026)

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

Fair Set Cover
por: Dehghankar, Mohsen, et al.
Publicado: (2024)

Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2025)

Online Algorithms for Geometric Independent Set
por: De, Minati, et al.
Publicado: (2026)

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-$f$ Time Barrier
por: Bukov, Anton, et al.
Publicado: (2023)

Minimum Sum Set Cover: Structures and Algorithm
por: Zhang, Zhongyi, et al.
Publicado: (2026)

Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming
por: Samanta, Sukanya, et al.
Publicado: (2025)

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

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
por: Saito, Rin, et al.
Publicado: (2025)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
por: D'Angelo, Gianlorenzo, et al.
Publicado: (2025)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
por: Bhore, Sujoy, et al.
Publicado: (2026)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
por: Wan, Zongqi, et al.
Publicado: (2024)

Online Bin Covering with Frequency Predictions
por: Berg, Magnus, et al.
Publicado: (2024)

Learning-Augmented Online Covering Problems
por: Ameli, Afrouz Jabal, et al.
Publicado: (2025)

Min-Sum Set Cover on Parallel Machines
por: Szyfelbein, Michał
Publicado: (2026)

Random Order Set Cover is as Easy as Offline
por: Gupta, Anupam, et al.
Publicado: (2021)

Risk-Sensitive Online Algorithms
por: Christianson, Nicolas, et al.
Publicado: (2024)

Parameterized Algorithms for Computing Pareto Sets
por: Könen, Joshua, et al.
Publicado: (2025)

Structural Parameterization of Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Lipschitz Continuous Algorithms for Covering Problems
por: Kumabe, Soh, et al.
Publicado: (2023)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
por: Bougeret, Marin, et al.
Publicado: (2025)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
por: He, Jialin, et al.
Publicado: (2025)

Non-Signaling Locality Lower Bounds for Dominating Set
por: Fleming, Noah, et al.
Publicado: (2026)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)

Online Algorithms with Randomly Infused Advice
por: Emek, Yuval, et al.
Publicado: (2023)

Online Firefighting on Cactus Graphs
por: Hugen, Max, et al.
Publicado: (2025)

Parameterized Algorithms for Minimum Sum Vertex Cover
por: Aute, Shubhada, et al.
Publicado: (2024)

Sublinear Algorithms for TSP via Path Covers
por: Behnezhad, Soheil, et al.
Publicado: (2023)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
por: Dey, Palash, et al.
Publicado: (2024)

Compressed Set Representations based on Set Difference
por: Gagie, Travis, et al.
Publicado: (2026)