DIMACS Reading Seminar in Algorithms
Koutsoupias-Pappadimitriou's 2k-1 competitive ratio for the k-server problem
- Seminar Room 431, CoRE Building,
- Busch Campus, Rutgers University.
We will read the Koutsoupias-Papadimitriou result showing
that the competitive ratio of the k-server problem
is 2k-1. We will read it from Koutsoupias' Ph.D. thesis,
which is available on the WWW at:
- 3:00 - 4:30 PM (NOTE CHANGE IN STARTING TIME)
- Thursday, January 25, 1996
(The thesis is 39 pages, the part relevant for us
is the first 22 pages).
Document last modified on December 11, 1995