Results 1  10
of
419,832
Competitive kServer Algorithms
 Journal of Computer and System Sciences
, 1990
"... In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture [MMS] up to the competitive ratio. The best previous result for general metric spaces was a 3server randomized competitive algorithm [BKT] and a nonconstructive ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture [MMS] up to the competitive ratio. The best previous result for general metric spaces was a 3server randomized competitive algorithm [BKT] and a non
Competitive kServer Algorithms
, 1991
"... In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture up to the competitive ratio, The best previous result for general metric spaces was a threeserver randomized competitive algorithm and a nonconstructive proof t ..."
Abstract
 Add to MetaCart
In this paper we give deterministic competitive kserver algorithms for all k and all metric spaces. This settles the kserver conjecture up to the competitive ratio, The best previous result for general metric spaces was a threeserver randomized competitive algorithm and a nonconstructive proof
KServer Problem
"... pace M with a distance function d (which is symmetric in most of the cases we consider). There are k servers in this space. The request sequence is oe = oe 1 oe 2 : : :, where oe i is a point in M . The online algorithm's response to oe i should be to move a server j to point oe i to serve the ..."
Abstract
 Add to MetaCart
the request. The cost measure is the total distance moved by all the servers. Example: Let M be the uniform metric space over n points. That is the metric space where the distance between every pair of points is 1. It is easy to see that the kserver problem on the uniform metric space is isomorphic
On the kServer Conjecture
 Journal of the ACM
, 1995
"... We prove that the work function algorithm for the kserver problem has competitive ratio at most 2k \Gamma 1. Manasse, McGeoch, and Sleator [24] conjectured that the competitive ratio for the kserver problem is exactly k (it is trivially at least k); previously the best known upper bound was ex ..."
Abstract

Cited by 113 (6 self)
 Add to MetaCart
We prove that the work function algorithm for the kserver problem has competitive ratio at most 2k \Gamma 1. Manasse, McGeoch, and Sleator [24] conjectured that the competitive ratio for the kserver problem is exactly k (it is trivially at least k); previously the best known upper bound
The Kserver problem with distinguishable servers
, 1991
"... This report gives a survey of existing results in the field of online kserver algorithms and presents some new findings. The survey includes optimal online algorithms for k servers on a line or a tree, an optimal online algorithm for 2 servers in any metric space, and an optimal online algorith ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
line algorithm for n − 1 servers in a metric space with n points. The first part of the newer material pertains to the traditional kserver problem. The equivalence of the Tree and Line Potential Functions is discussed. An algorithm is given that works in any finite metric space with a competitiveness
The Delayed kServer Problem
"... Abstract. We introduce a new version of the server problem: the delayed server problem. In this problem, once a server moves to serve a request, it must wait for one round to move again, but could serve a repeated request to the same point. We show that the delayed kserver problem is equivalent to ..."
A PolylogarithmicCompetitive Algorithm for the kServer Problem
"... We give the first polylogarithmiccompetitive randomized online algorithm for the kserver problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log 2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k − ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We give the first polylogarithmiccompetitive randomized online algorithm for the kserver problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log 2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k
The KServer Dual and Loose Competitiveness for Paging
 Algorithmica
, 1994
"... Weighted caching is a generalization of paging in which the cost to ..."
Abstract

Cited by 73 (6 self)
 Add to MetaCart
Weighted caching is a generalization of paging in which the cost to
The Harmonic kServer Algorithm is Competitive
 Journal of the ACM
, 1991
"... The kserver problem is a generalization of the paging problem, and is the most studied problem in the area of competitive online problems. The Harmonic algorithm is a very natural and simple randomized algorithm for the kserver problem. We give a simple proof that the Harmonic kserver algorith ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
The kserver problem is a generalization of the paging problem, and is the most studied problem in the area of competitive online problems. The Harmonic algorithm is a very natural and simple randomized algorithm for the kserver problem. We give a simple proof that the Harmonic kserver
Online kserver routing problems
 Proceedings of the 4th Workshop on on Approximation and Online Algorithms, Lecture Notes in Computer Science
, 2006
"... In an online kserver routing problem, a crew of k servers has to visit points in a metric space as they arrive in real time. Possible objective functions include minimizing the makespan (kTraveling Salesman Problem) and minimizing the average completion time (kTraveling Repairman Problem). We g ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
give competitive algorithms, resource augmentation results and lower bounds for kserver routing problems on several classes of metric spaces. Surprisingly, in some cases the competitive ratio is dramatically better than that of the corresponding single server problem. Namely, we give a 1 + O(log k/k)competitive
Results 1  10
of
419,832