✦ LIBER ✦

A competitive 2-server algorithm

✍ Scribed by Sandy Irani; Ronitt Rubinfeld

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 842 KB
Volume: 39
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90160-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Competitive k-server algorithms

✍ Amos Fiat; Yuval Rabani; Yiftach Ravid 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1008 KB

In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server conjecture up to the competitive ratio, The best previous result for general metric spaces was a three-server randomized competitive algorithm and a nonconstructive proof th

The Distributedk-Server Problem—A Compet

The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms

✍ Yair Bartal; Adi Rosén 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Algorithms Ž . x 11 1990 , 208᎐230 in a distributed setting. Given a network of n processors and k identical mobile servers, requests for service appear at the processors and a server must reach the request point. In addition to modeling problems in computer networks where k identical mobile resour

Generosity Helps or an 11-Competitive Al

Generosity Helps or an 11-Competitive Algorithm for Three Servers

✍ M. Chrobak; L.L. Larmore 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1010 KB

We propose a new algorithm, called Equipoise, for the \(k\)-server problem, and we prove that it is two-competitive for two servers and 11 -competitive for three servers. For \(k=3\), this is a substantial improvement over previously known constants. The algorithm uses several general techniques-con

Geometric two-server algorithms

✍ Ran El-Yaniv; Jon Kleinberg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 406 KB

A better lower bound on the competitive

A better lower bound on the competitive ratio of the randomized 2-server problem

✍ Marek Chrobak; Lawrence L. Larmore; Carsten Lund; Nick Reingold 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 482 KB

We present a lower bound of 1 + e-"' z 1.6065 on the competitive ratio of randomized algorithms for the weighted 2-cache problem, which is a special case of the 2-server problem. This improves the previously best known lower bound of e/(e-1) N 1.582 for both problems. @

A Simple Competitive Graph Coloring Algo

A Simple Competitive Graph Coloring Algorithm

✍ H.A. Kierstead 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 157 KB

We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this resu