Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
Competitive paging and dual-guided on-line weighted caching and watching algorithms
Competitive paging and dual-guided on-line weighted caching and watching algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
On-line algorithms and the K-server conjecture
On-line algorithms and the K-server conjecture
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
The 3-Server Problem in the Plane
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
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
Extending the Accommodating Function
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Online distributed object migration
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Computer Science Review
The k-resource problem in uniform metric spaces
Theoretical Computer Science
A new approach to solve the k-server problem based on network flows and flow cost reduction
Computers and Operations Research
| Hi-index | 0.00 |
We study the k-server problem when the off-line algorithm has fewer than k servers. We give two upper bounds of the cost WFA(\math) of the Work Function Algorithm. The first upper bound is \math, where \math denotes the optimal cost to service \math by m servers. The second upper bound is \math for \math. Both bounds imply that the Work Function Algorithm is (2k-1)-competitive. Perhaps more important is our technique which seems promising for settling the k-server conjecture. The proofs are simple and intuitive and they do not involve potential functions. We also apply the technique to give a simple condition for the Work Function Algorithm to be k-competitive; this condition results in a new proof that the k-server conjecture holds for k=2.