Imagen de Portada

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Basiak, Mateusz, Bienkowski, Marcin, Böhm, Martin, Chrobak, Marek, Jeż, Łukasz, Sgall, Jiří, Tatarczuk, Agnieszka
Formato:	Preprint
Publicado:	2025
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

Online Bisection with Ring Demands
por: Basiak, Mateusz, et al.
Publicado: (2026)

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

Two Complexity Results on Spanning-Tree Congestion Problems
por: Atalig, Sunny, et al.
Publicado: (2026)

A Subquadratic Bound for Online Bisection
por: Bienkowski, Marcin, et al.
Publicado: (2023)

Speed-robust scheduling revisited
por: Minařík, Josef, et al.
Publicado: (2024)

A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
por: Atalig, Sunny, et al.
Publicado: (2025)

Improved online load balancing with known makespan
por: Böhm, Martin, et al.
Publicado: (2024)

Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
por: Bienkowski, Marcin, et al.
Publicado: (2026)

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
por: Atalig, Sunny, et al.
Publicado: (2024)

Learning Minimum Linear Arrangement of Cliques and Lines
por: Dallot, Julien, et al.
Publicado: (2024)

On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
por: Kuschner, Jordan, et al.
Publicado: (2024)

On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
por: Clark, Emily, et al.
Publicado: (2024)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

Online List Labeling with Near-Logarithmic Writes
por: Seybold, Martin P.
Publicado: (2024)

List Update with Delays or Time Windows
por: Azar, Yossi, et al.
Publicado: (2023)

Contract Scheduling with Distributional and Multiple Advice
por: Angelopoulos, Spyros, et al.
Publicado: (2024)

Transposition is Nearly Optimal for IID List Update
por: Coester, Christian
Publicado: (2026)

Competitive Online Transportation Simplified
por: Arndt, Stephen, et al.
Publicado: (2025)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
por: Bishnu, Arijit, et al.
Publicado: (2024)

Competitive Policies for Online Collateral Maintenance
por: Almashaqbeh, Ghada, et al.
Publicado: (2024)

Competitive Analysis of Online Facility Assignment Algorithms on Discrete Grid Graphs: Performance Bounds and Remediation Strategies
por: Alif, Lamya, et al.
Publicado: (2026)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
por: Lechowicz, Adam, et al.
Publicado: (2023)

Online General Knapsack with Reservation Costs
por: Burjons, Elisabet, et al.
Publicado: (2025)

Online Paging with Heterogeneous Cache Slots
por: Chrobak, Marek, et al.
Publicado: (2022)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
por: Ganz, Amit, et al.
Publicado: (2023)

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
por: Goyal, Vineet, et al.
Publicado: (2020)

Private List Learnability vs. Online List Learnability
por: Hanneke, Steve, et al.
Publicado: (2025)

Weighted $k$-Server Admits an Exponentially Competitive Algorithm
por: Bijoy, Adithya, et al.
Publicado: (2025)

A Competitive Algorithm for Throughput Maximization on Identical Machines
por: Moseley, Benjamin, et al.
Publicado: (2021)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
por: Dufay, Marc, et al.
Publicado: (2025)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
por: Chekuri, Chandra, et al.
Publicado: (2024)

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
por: Rohwedder, Lars
Publicado: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
por: Łącki, Jakub, et al.
Publicado: (2025)

Online Matching with Delays and Size-based Costs
por: Kawase, Yasushi, et al.
Publicado: (2024)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
por: Ma, Will, et al.
Publicado: (2019)

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

Online Matching on $3$-Uniform Hypergraphs
por: Borst, Sander, et al.
Publicado: (2024)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
por: Harada, Tsubasa
Publicado: (2024)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
por: Zhai, Jianing, et al.
Publicado: (2019)