New results about the list access problem

Abstract

We consider the list access problem and show that two unrealistic assumptions in the original cost model presented in and subsequent literature allow for several competitiveness resulst of the move-to-front heuristic (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 k-competitive for any constant k, MTF included.