Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann. Improved Bounds for Online Preemptive Matching. In Natacha Portier, Thomas Wilke, editors, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. Volume 20 of LIPIcs, pages 389-399, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. [doi]
@inproceedings{EpsteinLSW13,
title = {Improved Bounds for Online Preemptive Matching},
author = {Leah Epstein and Asaf Levin and Danny Segev and Oren Weimann},
year = {2013},
doi = {10.4230/LIPIcs.STACS.2013.389},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2013.389},
researchr = {https://researchr.org/publication/EpsteinLSW13},
cites = {0},
citedby = {0},
pages = {389-399},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany},
editor = {Natacha Portier and Thomas Wilke},
volume = {20},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-50-7},
}