The k-server problem is perhaps the most influential online problem: natural, crisp, with a
surprising technical depth that manifests the richness of competitive analysis. The k-server …

This paper provides a novel technique for the analysis of randomized algorithms for
optimization problems on metric spaces, by relating the randomized performance ratio for …

Web caches can not only reduce network traffic and downloading latency, but can also affect
the distribution of web traffic over the network through cost-aware caching. This paper …

The primal–dual method is a powerful algorithmic technique that has proved to be extremely
useful for a wide variety of problems in the area of approximation algorithms for NP-hard …

In practice, almost all dynamic systems require decisions to be made on-line, without full
knowledge of their future impact on the system. A general model for the processing of …

The paging problem is that of deciding which pages to keep in a memory of k pages in order
to minimize the number of page faults. We develop the marking algorithm, a randomized on …

Competitive analysis is concerned with comparing the performance of on-line algorithms
with that of optimal off-line algorithms. In some cases randomization can lead to algorithms …

Against in adaptive adversary, we show that the power of randomization in on-line
algorithms is severely limited! We prove the existence of an efficient “simulation” of …

During the last 15 years online algorithms have received considerable research interest. In
this survey we give an introduction to the competitive analysis of online algorithms and …

We prove that the work function algorithm for the k-server problem has a competitive ratio at
most 2 k− 1. Manasse et al.[1988] conjectured that the competitive ratio for the k-server …