Improved Bounds for Online Preemptive Matching

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]

Abstract

Abstract is missing.