𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Geometric two-server algorithms

✍ Scribed by Ran El-Yaniv; Jon Kleinberg

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
406 KB
Volume
53
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On fast algorithms for two servers
On fast algorithms for two servers
✍ Marek Chrobak; Lawrence L Larmore πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 443 KB
Competitive k-server algorithms
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

Two problems with GGP generalized geomet
Two problems with GGP generalized geometric programming algorithm
✍ Yeh, Alexander πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 386 KB

The generalized geometric programming algorithm GGP has been found to be one of the better algorithms for optimizing algebraic functions subject to algebraic constraints. The paper discusses two problems with the GGP algorithm presented by Avriel et al. (1980). The first problem is that, because of

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