| Randomized Competitive Algorithms for the List Update Problem (1992) | |||||||||||||||
Abstract | |||||||||||||||
| We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan. We give a simple and elegant randomized algorithm that is more competitive than the best previous randomized algorithm due to Irani. Our algorithm uses randomness only during an initialization phase, and from then on runs completely deterministically. It is the first randomized competitive algorithm with this property to beat the deterministic lower bound. We generalize our approach to a model in which access costs are fixed but update costs are scaled by an arbitrary constant d. We prove lower bounds for deterministic list update algorithms and for randomized algorithms against oblivious and adaptive on-line adversaries. In particular, we show that for this problem adaptive on-line and adaptive off-line adversaries are equally powerful. 1 Introduction Recently much attention has been given to competitive analysis of on-line algorithms [7, 20, 22, 25]. Ro... | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||