Randomized k-server algorithms for growth-rate bounded graphs

Authors:
Yair Bartal;Manor Mendel
Affiliations:
The Hebrew University, Jerusalem;The Hebrew University, Jerusalem
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 16
Cited 3

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for server problems

Journal of Algorithms
Competitive paging algorithms

Journal of Algorithms
On the k-server conjecture

Journal of the ACM (JACM)
A polylog(n)-competitive algorithm for metrical task systems

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Competitive analysis of randomized paging algorithms

Theoretical Computer Science
A randomized algorithm for two servers on the line

Information and Computation
Approximating min-sum k-clustering in metric spaces

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A general decomposition theorem for the k-server problem

Information and Computation
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems

SIAM Journal on Computing
A tight bound on approximating arbitrary metrics by tree metrics

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On metric ramsey-type phenomena

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A Ramsey-Type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Better Algorithms for Unfair Metrical Task Systems and Applications

SIAM Journal on Computing

Three dozen papers on online algorithms

ACM SIGACT News
Competitive Analysis for the On-line Truck Transportation Problem

Journal of Global Optimization
Randomized k-server on hierarchical binary trees

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k) competitive ratios. This goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction obtaining o(k) competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k. Prior to this work no result of this type was known beyond results for specific metric spaces.