The Online k-Taxi Problem

07/17/2018
by   Christian Coester, et al.
0

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 traveled by taxis while not carrying a passenger, i.e., the distance from s to t is excluded from the cost. The hard k-taxi problem is substantially more difficult than the easy version with at least an exponential deterministic competitive ratio, Ω(2^k), admitting a reduction from the layered width-k graph traversal problem. In contrast, the easy k-taxi problem has exactly the same competitive ratio as the k-server problem. For the hard k-taxi problem on hierarchically separated trees (HSTs), we present a memoryless randomized algorithm with competitive ratio 2^k-1 against adaptive online adversaries and provide a matching lower bound. Due to well-known HST embedding techniques, this yields a randomized O(2^k n)-competitive algorithm for arbitrary n-point metric spaces. 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 on general metric spaces.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2017

Fusible HSTs and the randomized k-server conjecture

We show that a potential-based algorithm for the fractional k-server pro...
research
09/17/2020

Metrical Service Systems with Transformations

We consider a generalization of the fundamental online metrical service ...
research
02/09/2022

Shortest Paths without a Map, but with an Entropic Regularizer

In a 1989 paper titled "shortest paths without a map", Papadimitriou and...
research
04/08/2019

Parametrized Metrical Task Systems

We consider parametrized versions of metrical task systems and metrical ...
research
05/03/2023

Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else

We study the Online Traveling Salesperson Problem (OLTSP) with predictio...
research
07/18/2023

The Role of Dimension in the Online Chasing Problem

Let (X, d) be a metric space and 𝒞⊆ 2^X – a collection of special object...
research
04/10/2019

The Mobile Server Problem

We introduce the mobile server problem, inspired by current trends to mo...

Please sign up or login with your details

Forgot password? Click here to reset