Results 1  10
of
291,614
The Distributed kServer Problem  A Competitive Distributed Translator for kServer Algorithms
, 1992
"... We consider the kserver problem [23] in a distributed setting. ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We consider the kserver problem [23] in a distributed setting.
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
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
Online algorithms and the kserver conjecture
, 1994
"... The Work Function Algorithm, a natural algorithm for the kserver problem, is shown to have competitive ratio at most 2k − 1 for all metric spaces. It is also shown that the kserver conjecture, which states that there is an online algorithm for the kserver problem with competitive ratio k, holds ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
The Work Function Algorithm, a natural algorithm for the kserver problem, is shown to have competitive ratio at most 2k − 1 for all metric spaces. It is also shown that the kserver conjecture, which states that there is an online algorithm for the kserver problem with competitive ratio k, holds
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
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
The OnLine KServer Problem
 Computational Linguistics
, 1997
"... We survey the research performed during the last few years on the online kserver problem over metric spaces. A variety of algorithms are presented  both deterministic and randomized  and their performance is studied in the framework of competitive analysis. Restrictions of the problem to ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We survey the research performed during the last few years on the online kserver problem over metric spaces. A variety of algorithms are presented  both deterministic and randomized  and their performance is studied in the framework of competitive analysis. Restrictions of the problem
A General Decomposition Theorem for the kServer Problem
 Information and Computation
, 2001
"... The first general decomposition theorem for the kserver problem is presented. Whereas all previous theorems are for the case of a finite metric with k + 1 points, the theorem given here allows an arbitrary number of points in the underlying metric space. This theorem implies O(polylog(k))compet ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
The first general decomposition theorem for the kserver problem is presented. Whereas all previous theorems are for the case of a finite metric with k + 1 points, the theorem given here allows an arbitrary number of points in the underlying metric space. This theorem implies O(polylog(k))competitive
Randomized KServer on Hierarchical Binary Trees
"... We design a randomized online algorithm for kserver on binary trees with hierarchical edge lengths, with expected competitive ratio O(log ∆), where ∆ is the diameter of the metric. This is one of the first kserver algorithms with competitive ratio polylogarithmic in the natural problem parameters ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We design a randomized online algorithm for kserver on binary trees with hierarchical edge lengths, with expected competitive ratio O(log ∆), where ∆ is the diameter of the metric. This is one of the first kserver algorithms with competitive ratio polylogarithmic in the natural problem
Results 1  10
of
291,614