A better lower bound on the competitive ratio of the randomized 2-server problem

Information Processing Letters

Volumn 63, Issue 2, 1997, Pages 79-83

  Chrobak, Marek ^c   Larmore, Lawrence L ^a   Lund, Carsten ^b   Reingold, Nick ^b  

^a University of Nevada Las Vegas   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c NONE

Author keywords

Competitive analysis; Online algorithms; Randomized algorithms

Indexed keywords

EID: 0002003632     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00099-9     Document Type: Article

References (14)

1. D. Achlioptas, M. Chrobak and J. Noga, Competitive analysis of randomized paging algorithms, in: Proc. 4th Ann. European Symp. on Algorithms, to appear.
2. A. Blum, H. Karloff, Y. Rabani and M. Saks, A decomposition theorem and lower bounds for randomized server problems, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science (1992) 197-207.
3. M. Chrobak, H. Karloff, T.H. Payne and S. Vishwanathan, New results on server problems, SIAM J. Discrete Math. 4 (1991) 172-181 ; also in: Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco (1990) 291-300.
4. M. Chrobak, H. Karloff, T.H. Payne and S. Vishwanathan, New results on server problems, SIAM J. Discrete Math. 4 (1991) 172-181 ; also in: Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco (1990) 291-300.
5. M. Chrobak and L.L. Larmore, A new approach to the server problem, SIAM J. Discrete Math. 4 (1991) 323-328.
6. M. Chrobak and L.L. Larmore, An optimal online algorithm for k servers on trees, SIAM J. Comput. 20 (1991) 144-148.
7. A. Karlin, M. Manasse, L. McGeoch and S. Owicki, Randomized competitive algorithms for non-uniform problems, in: Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms (1990) 301-309
8. ; also in: Algorithmica, to appear.
9. E. Koutsoupias and C. Papadimitriou, On the k-server conjecture, in: Proc. 25th Symp. on Theory of Computing (1994) 507-511.
10. E. Koutsoupias and C. Papadimitriou, The 2-evader problem, Inform. Process. Lett. 57 (1996) 249-252.
11. C. Lund and N. Reingold, Linear programs for randomized on-line algorithms, in: Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (1994) 382-391.
12. M. Manasse, L.A. McGeoch and D. Sleator, Competitive algorithms for server problems, J. Algorithms 11 (1990) 208-230.
13. L. McGeoch and D. Sleator, A strongly competitive randomized paging algorithm, J. Algorithms 6 (1991) 816-825.
14. A.C. Yao, Probabilistic computations: Towards a unified measure of complexity, in: Proc. 12th ACM Symp. on Theory of Computing, 1980.