skip to main content
10.1145/3313276.3316370acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

The online 𝑘-taxi problem

Published: 23 June 2019 Publication History

Abstract

We consider the online k-taxi problem, a generalization of the k-server problem, in which k taxis serve a sequence of requests in a metric space. A request consists of two points s and t, representing a passenger that wants to be carried by a taxi from s to t. The goal is to serve all requests while minimizing the total distance traveled by all taxis. The problem comes in two flavors, called the easy and the hard k-taxi problem: In the easy k-taxi problem, the cost is defined as the total distance traveled by the taxis; in the hard k-taxi problem, the cost is only the distance of empty runs.
The hard k-taxi problem is substantially more difficult than the easy version with at least an exponential deterministic competitive ratio, Ω(2k), admitting a reduction from the layered graph traversal problem. In contrast, the easy k-taxi problem has exactly the same competitive ratio as the k-server problem. We focus mainly on the hard version. For hierarchically separated trees (HSTs), we present a memoryless randomized algorithm with competitive ratio 2k−1 against adaptive online adversaries and provide two matching lower bounds: for arbitrary algorithms against adaptive adversaries and for memoryless algorithms against oblivious adversaries. Due to well-known HST embedding techniques, the algorithm implies a randomized O(2klogn)-competitive algorithm for arbitrary n-point metrics. This is the first competitive algorithm for the hard k-taxi problem for general finite metric spaces and general k. For the special case of k=2, we obtain a precise answer of 9 for the competitive ratio in general metrics. With an algorithm based on growing, shrinking and shifting regions, we show that one can achieve a constant competitive ratio also for the hard 3-taxi problem on the line (abstracting the scheduling of three elevators).

References

[1]
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, and Joseph Naor. 2011.
[2]
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. In IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS ’11). 267–276.
[3]
Nikhil Bansal, Marek Eliáš, Łukasz Jeż, and Grigorios Koumoutsos. 2017. The ( h, k)-Server Problem on Bounded Depth Trees. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017. SIAM, 1022– 1037.
[4]
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, and Kirk Pruhs. 2018.
[5]
Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62, 2 (2018), 349–365. 016- 9703- 3
[6]
Nikhil Bansal, Marek Eliás, and Grigorios Koumoutsos. 2017. Weighted k-Server Bounds via Combinatorial Dichotomies. In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS ’17). 493–504. org/10.1109/FOCS.2017.52
[7]
Yair Bartal. 1996.
[8]
Probabilistic Approximation of Metric Spaces and its Algorithmic Applications. In In 37th Annual Symposium on Foundations of Computer Science (FOCS ’96). 184–193.
[9]
Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, and Avi Wigderson. 1994. On the Power of Randomization in On-Line Algorithms. Algorithmica 11, 1 (1994), 2–14.
[10]
Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, and Aleksander Madry. 2018. k-server via multiscale entropic regularization. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC ’18). 3–16.
[11]
William R. Burley. 1996. Traversing Layered Graphs Using the Work Function Algorithm. J. Algorithms 20, 3 (1996), 479–511.
[13]
Marek Chrobak, Howard Karloff, Tom Payne, and Sundar Vishwanathan. 1991.
[14]
New results on server problems. SIAM J. Discrete Math. 4, 2 (1991), 172–181.
[15]
Marek Chrobak and Lawrence L. Larmore. 1991. An optimal on-line algorithm for k servers on trees. SIAM J. Comput. 20, 1 (1991), 144–148. 1137/0220008
[16]
Christian Coester and Elias Koutsoupias. 2018. The Online k-Taxi Problem. CoRR abs/1807.06645 (2018). arXiv: 1807.06645
[17]
Christian Coester, Elias Koutsoupias, and Philip Lazos. 2017. The Infinite Server Problem. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). 14:1–14:14.
[18]
Don Coppersmith, Peter Doyle, Prabhakar Raghavan, and Marc Snir. 1993. Random Walks on Weighted Graphs and Applications to On-line Algorithms. J. ACM 40, 3 (1993), 421–453.
[19]
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, and Saeed Seddighin. 2017. Stochastic k-Server: How Should Uber Work?. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). 126:1–126:14.
[20]
Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. 2003. A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics. In Proceedings of the Thirtyfifth Annual ACM Symposium on Theory of Computing (STOC ’03). 448–455.
[21]
Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, and Sundar Vishwanathan. 1998. Competitive Algorithms for Layered Graph Traversal. SIAM J. Comput. 28, 2 (1998), 447–462.
[22]
Amos Fiat, Yuval Rabani, and Yiftach Ravid. 1990. Competitive k-Server Algorithms (Extended Abstract). In 31st Annual Symposium on Foundations of Computer Science (FOCS ’90). 454–463.
[23]
Andrew P. Kosoresow. 1996.
[24]
Design and analysis of online algorithms for mobile server applications. Ph.D. Dissertation. Stanford University.
[25]
Elias Koutsoupias. 2009. The k-server problem. Computer Science Review 3, 2 (2009), 105–118.
[26]
Elias Koutsoupias and Christos H. Papadimitriou. 1995. On the k-server conjecture. J. ACM 42, 5 (1995), 971–983.
[27]
James R. Lee. 2018.
[28]
Fusible HSTs and the randomized k-server conjecture. In Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS ’18). 438–449.
[29]
Mark Manasse, Lyle McGeoch, and Daniel Sleator. 1988. Competitive algorithms for on-line problems. In Proceedings of the twentieth annual ACM Symposium on Theory of Computing (STOC ’88). ACM, 322–333.
[31]
Christos H. Papadimitriou and Mihalis Yannakakis. 1991. Shortest paths without a map. Theoretical Computer Science 84, 1 (1991), 127–150. 1016/0304- 3975(91)90263- 2
[32]
Prabhakar Raghavan and Marc Snir. 1994. Memory versus randomization in online algorithms. IBM Journal of Research and Development 38, 6 (1994), 683–708.

Cited By

View all
  • (2025)Online Paging with Heterogeneous Cache SlotsAlgorithmica10.1007/s00453-024-01270-z87:1(89-131)Online publication date: 1-Jan-2025
  • (2024)Algorithms for Future Mobility SocietyAdvanced Mathematical Science for Mobility Society10.1007/978-981-99-9772-5_9(173-185)Online publication date: 14-Mar-2024
  • (2023)LiteHST: A Tree Embedding based Method for Similarity SearchProceedings of the ACM on Management of Data10.1145/35887151:1(1-26)Online publication date: 30-May-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
June 2019
1258 pages
ISBN:9781450367059
DOI:10.1145/3313276
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 June 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. competitive analysis
  2. k-server
  3. online algorithms

Qualifiers

  • Research-article

Funding Sources

Conference

STOC '19
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)24
  • Downloads (Last 6 weeks)1
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Online Paging with Heterogeneous Cache SlotsAlgorithmica10.1007/s00453-024-01270-z87:1(89-131)Online publication date: 1-Jan-2025
  • (2024)Algorithms for Future Mobility SocietyAdvanced Mathematical Science for Mobility Society10.1007/978-981-99-9772-5_9(173-185)Online publication date: 14-Mar-2024
  • (2023)LiteHST: A Tree Embedding based Method for Similarity SearchProceedings of the ACM on Management of Data10.1145/35887151:1(1-26)Online publication date: 30-May-2023
  • (2023)Online Metric Algorithms with Untrusted PredictionsACM Transactions on Algorithms10.1145/358268919:2(1-34)Online publication date: 15-Apr-2023
  • (2023)The Randomized 𝑘-Server Conjecture Is False!Proceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585132(581-594)Online publication date: 2-Jun-2023
  • (2023)Any-Order Online Interval SelectionApproximation and Online Algorithms10.1007/978-3-031-49815-2_13(175-189)Online publication date: 22-Dec-2023
  • (2022)Shortest Paths without a Map, but with an Entropic Regularizer2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00036(1102-1113)Online publication date: Oct-2022
  • (2022)Efficient algorithms for ride-hitching in UAV travellingTheoretical Computer Science10.1016/j.tcs.2022.06.035929:C(140-156)Online publication date: 11-Sep-2022
  • (2022)Approximation algorithms for clustering with dynamic pointsJournal of Computer and System Sciences10.1016/j.jcss.2022.07.001130:C(43-70)Online publication date: 1-Dec-2022
  • (2022)Putting ridesharing to the test: efficient and scalable solutions and the power of dynamic vehicle relocationArtificial Intelligence Review10.1007/s10462-022-10145-055:7(5781-5844)Online publication date: 15-Feb-2022
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media