@InProceedings{liang_et_al:LIPIcs.ISAAC.2021.50,
author = {Liang, Ya-Chun and Lai, Kuan-Yun and Chen, Ho-Lin and Iwama, Kazuo},
title = {{Tight Competitive Analyses of Online Car-Sharing Problems}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {50:1--50:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.50},
URN = {urn:nbn:de:0030-drops-154835},
doi = {10.4230/LIPIcs.ISAAC.2021.50},
annote = {Keywords: Car-sharing, Competitive analysis, On-line scheduling, Randomized algorithm}
}