The online 𝑘-taxi problem-Reference-Cited by-同舟云学术

The online 𝑘-taxi problem

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Coester Christian¹,Koutsoupias Elias¹

Affiliation:

1. University of Oxford, UK

Funder

European Research Council

Engineering and Physical Sciences Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316370

Reference32 articles.

1. Nikhil Bansal Niv Buchbinder Aleksander Madry and Joseph Naor. 2011. Nikhil Bansal Niv Buchbinder Aleksander Madry and Joseph Naor. 2011.

2. A Polylogarithmic-Competitive Algorithm for the k-Server Problem

3. Nikhil Bansal Marek Eliás Lukasz Jez Grigorios Koumoutsos and Kirk Pruhs. 2018. Nikhil Bansal Marek Eliás Lukasz Jez Grigorios Koumoutsos and Kirk Pruhs. 2018.

4. Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62 2 (2018) 349–365. 016- 9703- 3 Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62 2 (2018) 349–365. 016- 9703- 3

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithms for Future Mobility Society;Advanced Mathematical Science for Mobility Society;2024

2. The Randomized -Server Conjecture Is False!;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. LiteHST: A Tree Embedding based Method for Similarity Search;Proceedings of the ACM on Management of Data;2023-05-26

4. Online Metric Algorithms with Untrusted Predictions;ACM Transactions on Algorithms;2023-04-15

5. Any-Order Online Interval Selection;Approximation and Online Algorithms;2023