Randomized k-server algorithms for growth-rate bounded graphs

Journal of Algorithms

Volumn 55, Issue 2, 2005, Pages 192-202

  Bartal, Yair ^a   Mendel, Manor ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

k server problem; Metric embedding; Randomized algorithms

Indexed keywords

APPROXIMATION THEORY; COSTS; DECISION MAKING; GRAPHIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

K-SERVER PROBLEMS; METRIC EMBEDDING; METRIC SPACES; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 14844365230     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.06.002     Document Type: Article

References (20)

1. Manasse M., McGeoch L.A., Sleator D. Competitive algorithms for server problems. J. Algorithms. 11:(2):1990;208-230
2. Koutsoupias E., Papadimitriou C. On the k -server conjecture. J. Assoc. Comput. Mach. 42:(5):1995;971-983
3. Bartal Y., Bollobás B., Mendel M. A Ramsey-type theorem for metric spaces and its application for metrical task systems and related problems. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science. 2001;396-405
4. Bartal Y., Linial N., Mendel M., Naor A. On metric Ramsey-type phenomena. 35th Annual ACM Symposium on Theory of Computing. 2003;463-472
5. Fiat A., Karp R., Luby M., McGeoch L.A., Sleator D.D., Young N.E. Competitive paging algorithms. J. Algorithms. 12:1991;685-699
6. McGeoch L., Sleator D. A strongly competitive randomized paging algorithm. Algorithmica. 6:(6):1991;816-825
7. Achlioptas D., Chrobak M., Noga J. Competitive analysis of randomized paging algorithms. Theoret. Comput. Sci. 234:2000;203-218
8. Irani S. Randomized weighted caching with two page weights. Algorithmica. 32:(4):2002;624-640
9. Bartal Y., Chrobak M., Larmore L.L. A randomized algorithm for two servers on the line. Informat. and Comput. 158:(1):2000;53-69
10. B. Csaba, S. Lodha, A randomized on-line algorithm for the k -server problem on a line, Technical Report 2001-34, DIMACS, October, 2001
11. Bartal Y., Blum A., Burch C., Tomkins A. A polylog( n )-competitive algorithm for metrical task systems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing. 1997;711-719
12. Fiat A., Mendel M. Better algorithms for unfair metrical task systems and applications. SIAM J. Comput. 32:(6):2003;1403-1422
13. Bartal Y. Probabilistic approximations of metric space and its algorithmic application. 37th Annual Symposium on Foundations of Computer Science. 1996;184-193
14. Bartal Y. On approximating arbitrary metrics by tree metrics. Proceedings of the 30th Annual ACM Symposium on Theory of Computing. 1998;161-168
15. Fakcharoenphol J., Rao S., Talwar K. A tight bound on approximating arbitrary metrics by tree metrics. Proceedings of the 35th ACM Symposium on Theory of Computing. 2003;448-455
16. Seiden S. A general decomposition theorem for the k -server problem. Informat. and Comput. 174:(2):2002;193-202
17. Linial N., London E., Rabinovich Y. The geometry of graphs and some of its algorithmic applications. Combinatorica. 15:(2):1995;215-245
18. Bartal Y., Charikar M., Raz D. Approximating min-sum k -clustering in metric spaces. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. 2001;11-20
19. Sleator D.D., Tarjan R.E. Amortized efficiency of list update and paging rules. Commun. ACM. 28:1985;202-208
20. Karlin A., Manasse M., Rudolph L., Sleator D.D. Competitive snoopy caching. Algorithmica. 3:(1):1988;79-119