A randomized on-line algorithm for the k-server problem on a line

Random Structures and Algorithms

Volumn 29, Issue 1, 2006, Pages 82-104

  Csaba, Béla ^a   Lodha, Sachin ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TATA RESEARCH DEVELOPMENT AND DESIGN CENTRE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746462253     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20124     Document Type: Article

References (28)

1. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, Proceedings of 37th Annual IEEE Symposium on Foundations of Computer Science, October 1996, pp. 184-193.
2. Y. Bartal, On approximating arbitrary metrices by tree metrics, Proceedings of 30th Annual ACM Symposium on Theory of Computing, May 1998, pp. 161-168.
3. Y. Bartal, A. Blum, C. Burch, and A. Tomkins, A polylog(n)-competitive algorithm for metrical task systems, Proceedings of 29th Annual ACM Symposium on Theory of Computing, May 1997, pp. 711-719.
4. Y. Bartal, B. Bollobás, and M. Mendel, A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems, Proceedings of 42nd Annual IEEE Symposium on Foundations of Computer Science, October 2001, pp. 396-405.
5. Y. Bartal, M. Chrobak, and L. Larmore, A randomized algorithm for two servers on the line, Inform Comput 158 (2000), 53-69.
6. Y. Bartal and E. Koutsoupias, On the competitive ratio of the work function algorithm for the k-server problem, Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science, February 2000, pp. 605-613.
7. W. Bein, M. Chrobak, and L. Larmore, The 3-server problem in the plane, Editor: J. Nesetril, Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, volume 1643 of Lecture Notes in Computer Science, Springer, 1999, pp. 301-312.
8. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the power of randomization in on-line algorithms, Algorithmica 11 (1994), 2-14.
9. A. Blum, H. Karloff, Y. Rabani, and M. Saks, A decomposition theorem for task systems and bounds for randomized server problems, SIAM J Comput 30(5) (2000), 1624-1661.
10. A. Blum, P. Raghavan, and B. Schieber, Navigating in unfamiliar geometric terrain, SIAM J Comput 26 (1997), 110-137.
11. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
12. A. Borodin, N. Linial, and M. Saks, An optimal online algorithm for metrical task system, J ACM 39 (1992), 745-763.
13. A. Calderbank, E. Coffman, and L. Flatto, Sequencing problems in two server systems, Math Oper Res 10 (1985), 585-598.
14. M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New results on server problems, SIAM J Discrete Math 4 (1991), 172-181.
15. M. Chrobak and L. Larmore, An optimal algorithm for k servers on trees, SIAM J Comput 20 (1991), 144-148.
16. B. Csaba, Note on the work function algorithm, Acta Cybernet 14 (2000), 503-506.
17. B. Csaba and S. Lodha, A randomized online algorithm for the k-server problem on a line, Technical Report 2001-34, DIMACS, October 2001.
18. A. Fiat and G. Woeginger (Eds.), Online Algorithms: State of the Art, Springer-Verlag, 1998.
19. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young, Competitive paging algorithms, J Algor 12(4) (1991), 685-699.
20. A. Fiat and M. Mendel, Better algorithms for unfair metrical task systems and applications, Proceedings of 32nd Annual ACM Symposium on Theory of Computing, May 2000, pp. 725-734.
21. S. Irani and A. Karlin, Online computation, Editor: D. Hochbaum, Approximation Algorithms for NP-hard Problems, PWS Publishing Company, 1997, pp. 521-564.
22. A. Karlin, M. Manasse, L. McGeoch, and S. Owicki, Competitive randomized algorithms for nonuniform problems, Algorithmica 11 (1994), 542-571.
23. E. Koutsoupias and C. Papadimitriou, On the k-server conjecture, J ACM 42(5) (1995), 971-983.
24. E. Koutsoupias and C. Papadimitriou, The 2-evader problem, Inform Process Lett 57(5) (1996), 249-252.
25. M. Manasse, L. McGeoch, and D. Sleator, Competitive algorithms for server problems, J Algor 11 (2) (1990), 208-230.
26. L. McGeoch and D. Sleator, A strongly competitive randomized paging algorithm, Algorithmica 6(6) (1991), 816-825.
27. S. Seiden, A general decomposition theorem for the k-server problem, Editor: F. Meyer auf der Heide, Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, volume 2161 of Lecture Notes in Computer Science, Springer, 2001, pp. 86-97.
28. D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules, Commun ACM 28(2) (1985), 202-208.