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.
|Titel||Automata, Languages and Programming (Proceedings 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30-July 4, 2003)|
|Redacteuren||J.C.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger|
|Plaats van productie||Berlin|
|ISBN van geprinte versie||3-540-40493-7|
|Status||Gepubliceerd - 2003|
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|