Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for server problems
Journal of Algorithms
Random walks on weighted graphs, and applications to on-line algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
The harmonic online K-server algorithm is competitive
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
New results on server problems
SIAM Journal on Discrete Mathematics
A competitive 2-server algorithm
Information Processing Letters
On fast algorithms for two servers
Journal of Algorithms
Journal of Algorithms
Competitive algorithms for layered graph traversal
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A competitive 3-server algorithm
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Competitive randomized algorithms for non-uniform problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Journal of the ACM (JACM)
The harmonic k-server algorithm is competitive
Journal of the ACM (JACM)
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Towards the randomized k-server conjecture: a primal-dual approach
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
| Hi-index | 0.00 |
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server conjecture up to the competitive ratio. The best previous result for general metric spaces was a three-server randomized competitive algorithm and a non-constructive proof that a deterministic three-server competitive algorithm exists. The competitive ratio we can prove is exponential in the number of servers. Thus, the question of the minimal competitive ratio for arbitrary metric spaces is still open.