Citation:
El-Yaniv, R. . (1996). There Are Infinitely Many Competitive-Optimal Online List Accessing Algorithms. Discussion Papers. presented at the 6. Retrieved from '
Abstract:
This paper presents a new family of optimal, 2-competitive, deterministic online list accessing algorithms. This family includes as members the well known MOVE-TO-FRONT (MTF) algorithm, and the recent, more "conservative" algorithm TIMESTAMP due to Albres.