Amortized efficiency of list update and paging rules
Communications of the ACM
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
Journal of Algorithms
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
On-line Learning and the Metrical Task System Problem
Machine Learning
A General Decomposition Theorem for the k-Server Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Better Algorithms for Unfair Metrical Task Systems and Applications
SIAM Journal on Computing
A randomized on–line algorithm for the k–server problem on a line
Random Structures & Algorithms
A Primal-Dual Randomized Algorithm for Weighted Paging
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online job-migration for reducing the electricity bill in the cloud
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
The k-resource problem in uniform metric spaces
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Coté et al [15] for well-separated binary Hierarchically Separated Trees (HSTs) to well-separated d-ary HSTs for poly-logarithmic values of d. One application of this result is an exp(O(√log log k log n))-competitive algorithm for k-server on n uniformly spaced points on a line. This substantially improves upon the prior guarantee of O(min(k, n2/3) for this metric [16]. These results are based on obtaining a refined guarantee for the unfair metrical task systems problem on an HST. Prior to our work, such a guarantee was only known for the case of a uniform metric [5,7,18]. Our results are based on the primal-dual approach for online algorithms. Previous primal-dual approaches in the context of k-server and MTS [2,4,3] worked only for uniform or weighted star metrics, and the main technical contribution here is to extend many of these techniques to work directly on HSTs.