@inproceedings{c9186009dbef43a18c22e7c0f3fa3a5e,

title = "A competitive algorithm for the general 2-server problem",

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.",

author = "R.A. Sitters and L. Stougie and {Paepe, de}, W.E.",

year = "2003",

doi = "10.1007/3-540-45061-0_50",

language = "English",

isbn = "3-540-40493-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "624--636",

editor = "J.C.M. Baeten and J.K. Lenstra and J. Parrow and G.J. Woeginger",

booktitle = "Automata, Languages and Programming (Proceedings 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30-July 4, 2003)",

address = "Germany",

}