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
Journal of the ACM (JACM)
Traversing layered graphs using the work function algorithm
Journal of Algorithms
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On the competitive ratio of the work function algorithm for the k-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
A competitive algorithm for the general 2-server problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Online chasing problems for regular polygons
Information Processing Letters
| Hi-index | 0.00 |
We consider the generalized on-line two-server problem in which each server moves in its own metric space. Requests for service arrive one-by-one and every request is represented by two points: one in each metric space. The problem is to move, at every request, one of the two servers to its request-point such that the total distance travelled by the two servers is minimized.The special case in which both metric spaces are the real line is known as the CNN-problem. It has been a well-known open question in on-line optimization if an algorithm with a constant-competitive ratio exists for this problem. We answer this question in the affirmative by providing a constant-competitive algorithm for the generalized two-server problem on any metric space.The basic result in this article is a characterization of competitiveness for metrical service systems that seems much easier to use when looking for a competitive algorithm. The existence of a competitive algorithm for the generalized two-server problem follows rather easily from this result.