| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6873890 | Information and Computation | 2018 | 10 Pages |
Abstract
The main contribution of this paper is to establish new lower and upper bounds on the competitive ratio achievable by randomized preemptive online algorithms:
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann,