The online 𝑘-taxi problem

DOI10.1145/3313276.3316370zbMath1433.68619arXiv1807.06645OpenAlexW2964172141MaRDI QIDQ5212853

Christian Coester, Elias Koutsoupias

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.06645

zbMATH Keywords

competitive analysisonline algorithms\(k\)-server

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (7)

Efficient algorithms for ride-hitching in UAV travelling ⋮ Approximation algorithms for clustering with dynamic points ⋮ Online Metric Algorithms with Untrusted Predictions ⋮ Online ride-hitching in UAV travelling ⋮ Reallocating multiple facilities on the line ⋮ Online \(k\)-taxi via double coverage and time-reverse primal-dual ⋮ Online \(k\)-taxi via double coverage and time-reverse primal-dual

This page was built for publication: The online 𝑘-taxi problem