Online \(k\)-taxi via double coverage and time-reverse primal-dual

DOI10.1007/s10107-022-01815-6OpenAlexW3111713649MaRDI QIDQ5925636

Joseph (Seffi) Naor, Christian Coester, Niv Buchbinder

Publication date: 14 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-022-01815-6

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• The \(k\)-server problem
• On the power of randomization in on-line algorithms
• Competitive \(k\)-server algorithms
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• Competitive paging algorithms
• On the k -server conjecture
• The online 𝑘-taxi problem
• k-server via multiscale entropic regularization
• k-Servers with a Smile: Online Algorithms via Projections
• Approximating Sparse Covering Integer Programs Online
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Online \(k\)-taxi via double coverage and time-reverse primal-dual