A competitive algorithm for the general 2-server problem

Authors:
René A. Sitters;Leen Stougie;Willem E. De Paepe
Affiliations:
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands and CWI, Amsterdam, The Netherlands;Department of Technology Management, Technische Universiteit Eindhoven, Eindhoven, The Netherlands
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 6
Cited 7

Competitive algorithms for server problems

Journal of Algorithms
An optimal on-line algorithm for K-servers on trees

SIAM Journal on Computing
New results on server problems

SIAM Journal on Discrete Mathematics
An optimal on-line algorithm for metrical task system

Journal of the ACM (JACM)
Competitive algorithms for the weighted server problem

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
On the k-server conjecture

Journal of the ACM (JACM)

SIGACT news online algorithms column 1

ACM SIGACT News
The orthogonal CNN problem

Information Processing Letters
The weighted 2-server problem

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The CNN problem and other k-server variants

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The generalized two-server problem

Journal of the ACM (JACM)
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem

Theoretical Computer Science
The k-server problem

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to its request. The special case where the requests are points on the real line is known as the CNN-problem. It has been a well-known open question if an algorithm with a constant competitive ratio exists for this problem. We answer this question in the affirmative sense by providing the first constant competitive algorithm for the general two-server problem on any metric space.