@InProceedings{birx_et_al:LIPIcs.APPROX-RANDOM.2019.21,
author = {Birx, Alexander and Disser, Yann and Schewior, Kevin},
title = {{Improved Bounds for Open Online Dial-a-Ride on the Line}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {21:1--21:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.21},
URN = {urn:nbn:de:0030-drops-112367},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.21},
annote = {Keywords: dial-a-ride on the line, elevator problem, online algorithms, competitive analysis, smartstart, competitive ratio}
}