Abstract
The randomized k-paging algorithm EQUITABLE given by Achlioptas et al. is Hk-competitive and uses O(k2 log k) memory. This competitive ratio is best possible. The randomized algorithm RMARK given by Fiat et al. is (2Hk - 1)-competitive, but only uses O(k) memory. Borodin and El Yaniv [6] list as an open question whether there exists an H k-competitive randomized algorithm which requires O(k) memory for k-paging. In this paper we answer this question in the affirmative by giving a modification of EQUITABLE. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Bein, W., Larmore, L. L., & Noga, J. (2007). Equitable revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4698 LNCS, pp. 419–426). Springer Verlag. https://doi.org/10.1007/978-3-540-75520-3_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
