@InProceedings{epstein_et_al:LIPIcs.STACS.2013.389,
author = {Epstein, Leah and Levin, Asaf and Segev, Danny and Weimann, Oren},
title = {{Improved Bounds for Online Preemptive Matching}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {389--399},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-50-7},
ISSN = {1868-8969},
year = {2013},
volume = {20},
editor = {Portier, Natacha and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.389},
URN = {urn:nbn:de:0030-drops-39501},
doi = {10.4230/LIPIcs.STACS.2013.389},
annote = {Keywords: Online algorithms, matching, lower bound}
}