Randomized k-Server on hierarchical binary trees

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 227-233

  Coté, Aaron ^a,b   Meyerson, Adam ^a,b   Poplawski, Laura ^a,b  

^a Engineering IV   (United States)

^b Northeastern University   (United States)

Author keywords

K server; Online competitive analysis

Indexed keywords

COMPUTATION THEORY; TREES (MATHEMATICS);

COMPETITIVE RATIO; EDGE LENGTH; HIERARCHICAL BINARY TREES; K-SERVER; ON-LINE ALGORITHMS; ONLINE COMPETITIVE ANALYSIS; PROBLEM PARAMETERS; SERVER PROBLEM;

BINARY TREES;

EID: 57049156649     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374411     Document Type: Conference Paper

References (22)

1. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. 37th IEEE Symposium on Foundations of Computer Science, 1996.
2. Y. Bartal. On approximating arbitrary metrics by tree metrics. 30th ACM Symposium on Theory of Computing, 1998.
3. 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. 42nd. IEEE Symposium on Foundations of Computer Science, 2001.
4. Y. Bartal, A. Blum, C. Burch, and A. Tomkins. A polylog(n)-competitive algorithm for metrical task systems. ACM Symposium on Theory of Computing, 1997.
5. A. Blum, H. Karloff, Y. Rabani, M. Saks. A Decomposition Theorem for Task Systems and Bounds for Randomized Server Algorithms. 33rd IEEE Symposium on Foundations of Computer Science, 1992.
6. Y. Bartal, E. Koutsoupias. On the competitive ratio of the work function algorithm for the κ-server problem. 17th Symposium on Theoretical Aspects of Computer Science, 2000.
7. Y. Bartal, M. Mendel. Randomized κ-Server Algorithms for Growth-Rate Bounded Graphs. Symposium on Discrete Algorithms, 2004.
8. M. Chrobak, H. Karloff, T. Payne, S. Vishwanathan. New Results on Server Problems. Symposium on Discrete Algorithms, 1990.
9. M. Chrobak and L. Larmore. The server problem and on-line games. On-line algorithms: proceedings of a DIMACS workshop. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 7:11-64, 1992.
10. M. Chrobak and L. Larmore. HARMONIC is three-Competitive for two servers. Theoretical Computer Science, 98:339-346, 1992.
11. M. Chrobak and L. Larmore. An Optimal On-line Algorithm for κ-Server on Trees. SIAM Journal on Computing, 20(1), 1991.
12. M. Chrobak and J. Sgall. A simple analysis of the harmonic algorithm for two servers. Information Processing Letters, 75:75-77, 2000.
13. B. Csaba and S. Lodha. A randomized on-line algorithm for the κ-server problem on a line. Technical Report 2001-34, DIMACS, 2001.
14. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. ACM Symposium on Theory of Computing, 2003.
15. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. Competitive Paging Algorithms. Journal of Algorithms, 12:685-699, 1991.
16. A. Fiat and M. Mendel. Better Algorithms for Unfair Metrical Task Systems and Applications. SIAM Journal on Computing, 32:1403-1422, 2003.
17. A. Fiat, Y. Rabani, Y. Ravid. Competitve κ-Server Algorithms. 31st IEEE Symposium on Foundations of Computer Science, 1990.
18. E. Koutsoupias. Weak adverseries for the κ-server problem. 40th IEEE Symposium on Foundations of Computer Science, 1999.
19. E. Koutsoupias and C. Papadimitriou. On the κ-server conjecture. Journal of the ACM 42(5), 1995.
20. M. Manasse, L. McGeoch, and D. Sleator. Competitive Algorithms for Server Problems. Journal of Algorithms (11, 208-230), 1990.
21. S. Seiden. Unfair Problems and Randomized Algorithms for Metrical Task Systems. Information and Computation, 148:219-240, 1999.
22. S. Seiden. A General Decomposition Theorem for the κ-Server Problem. European Symposium on Algorithms, 2001.