Online k-taxi via Double Coverage and time-reverse primal-dual

We consider the online k-taxi problem, a generalization of the k-server problem, in which k servers are located in a metric space. A sequence of requests is revealed one by one, where each request is a pair of two points, representing the start and destination of a travel request by a passenger. The...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors: Buchbinder, N, Coester, C, Naor, J
Format: Journal article
Sprog:English
Udgivet: Springer 2022

Lignende værker