Campus Event Calendar
Event Entry
New for: D3
What and Who
The 3-server problem in the plane
Wolfgang Bein
University of Las Vegas
AG1 Mittagsseminar
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 4 August 99
13:30
-- Not specified --
MPI
024
Saarbrücken
Abstract
We show that the Work Function Algorithm is 3-competitive
for the 3-server problem in the Manhattan plane.
As a corollary, we obtain a 4.243-competitive algorithm for
3 servers in the Euclidean plane.
Contact
Rudolf Fleischer
9325-119
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
online algorithm, k-server