About Us
Education
Research
PhD
Acta Cybernetica
Conferences
Sponsors
Departments:
-	Image Processing and Computer Graphics
-	Foundations of Computer Science
-	Computer Algorithms and Artificial Intelligence
-	Computational Optimization
-	Software Engineering
-	Research Group on Artificial Intelligence

[University of Szeged]

Research>>> Acta Cybernetica>>> Previous Volumes>>>

Magyarul

Note on the Work Function Algorithm

Béla Csaba 1

Acta Cybernetica 14 (2000) 503-506.

Abstract:

We prove that the work function algorithm is ( n -1)-competitive for the k -server problem, where n is the number of points in the metric space. This gives improved upper bounds when $k+3 \leq n \leq 2k-1$ ; in particular, it shows that the work function algorithm is optimal for k = n -1. Recently this result was proved independently by Koutsoupias in [K].

Footnotes

1. Department of Computer Science; Rutgers, The State University of NJ; 110 Frelinghuysen Road; Piscataway, NJ 08854-8019 USA. Email: bcsaba@paul.rutgers.edu Research partially supported by a DIMACS fellowship Research partially supported by OTKA T30074.

Kocsorne Sebo Marianna

7/5/2000

Webmaster:webmaster@inf.u-szeged.hu