An Improved Algorithm for Open Online Dial-a-Ride
Data Structures and Algorithms
2022-10-26 v1 Discrete Mathematics
Abstract
We consider the open online dial-a-ride problem, where transportation requests appear online in a metric space and need to be served by a single server. The objective is to minimize the completion time until all requests have been served. We present a new, parameterized algorithm for this problem and prove that it attains a competitive ratio of for some choice of its parameter, where is the golden ratio. This improves the best known bounds for open online dial-a-ride both for general metric spaces as well as for the real line. We also give a lower bound of~ for the competitive ratio of our algorithm for any parameter choice.
Keywords
Cite
@article{arxiv.2210.13854,
title = {An Improved Algorithm for Open Online Dial-a-Ride},
author = {Julia Baligacs and Yann Disser and Nils Mosis and David Weckbecker},
journal= {arXiv preprint arXiv:2210.13854},
year = {2022}
}