We consider the list access problem and show that one questionable
assumption in the original cost model presented by Sleator and Tarjan
(Amortized Efficiency of List Update and Paging Rules, CACM,
and subsequent literature allowed for several
competitiveness results of the move-to-front rule (MTF). We
present an off-line algorithm for the
list access problem and prove that, under a more realistic cost model,
no on-line algorithm can be c-competitive for any constant
c, MTF included.
CitationRoura, S., Martinez, C. "On the competitiveness of the move-to-front rule". 1996.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com