A general decomposition theorem for the k-server problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 86-97

  Seiden, Steven S ^a  

^a Louisiana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN DECOMPOSITION METHODS; SET THEORY;

ARBITRARY NUMBER; COMPETITIVE ALGORITHMS; DECOMPOSITION THEOREMS; K-SERVER PROBLEM; POLYLOGARITHMIC; POLYLOGARITHMIC NUMBERS; RANDOMIZED ALGORITHMS; UNIFORM METRIC;

TOPOLOGY;

EID: 84943246445     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_7     Document Type: Conference Paper

References (27)

1. Bartal, Y. Probabilistic approximation of metric spaces and its algorithmic appli-cations. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (1996), pp. 183-193.
2. Bartal, Y. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30th ACM Symposium on Theory of Computing (1998), pp. 161-168.
3. Bartal, Y., Blum, A., Burch, C., and Tomkins, A. A polylog(n)-competitive algorithm for metrical task systems. In Proceedings of the 29th ACM Symposium on Theory of Computing (1997), pp. 711-719.
4. Bartal, Y., Bollobás, B., and Mendel, M. Ramsey-type theorems for metric spaces and their application for metrical task systems. Manuscript, 2001.
5. Bartal, Y., Chrobak, M., and Larmore, L. L. A randomized algorithm for two servers on the line. Information and Computation 158, 1 (Apr 2000), 53-69.
6. Bein, W., Chrobak, M., and Larmore, L. The 3-server problem in the plane. In Proceedings of the 7th Annual European Symposium on Algorithms (Jul 1999), pp. 301-312.
7. Ben-David, S., Borodin, A., Karp, R., Tardos, G., and Wigderson, A. On the power of randomization in on-line algorithms. Algorithmica 11, 1 (Jan 1994), 2-14.
8. Blum, A., Burch, C., and Kalai, A. Finely-competitive paging. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (1999), pp. 450-457.
9. Blum, A., Karloff, H., Rabani, Y., and Saks, M. A decomposition theorem for task systems and bounds for randomized server problems. SIAM Journal on Computing 30, 5 (Dec 2000), 1624-1661.
10. Borodin, A., and El-Yaniv, R. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
11. Borodin, A., Linial, N., and Saks, M. An optimal online algorithm for metrical task systems. Journal of the ACM 39, 4 (Oct 1992), 745-763.
12. Chrobak, M., Karloff, H., Payne, T., and Vishwanathan, S. New results on server problems. SIAM Journal on Discrete Mathematics 4, 2 (May 1991), 172-181.
13. Chrobak, M., and Larmore, L. An optimal on-line algorithm for k-servers on trees. SIAM Journal on Computing 20, 1 (Feb 1991), 144-148.
14. Chrobak, M., and Larmore, L. L. Server problems and on-line games. In Proceedings of the DIMACS Workshop on On-line Algorithms (Feb 1991), pp. 11-64.
15. Chrobak, M., Larmore, L. L., Lund, C., and Reingold, N. A better lower bound on the competitive ratio of the randomized 2-server problem. Information Processing Letters 63, 2 (1997), 79-83.
16. Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., and Young, N. Competitive paging algorithms. Journal of Algorithms 12, 4 (Dec 1991), 685-699.
17. Fiat, A., and Mendel, M. Better algorithms for unfair metrical task systems and applications. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (May 2000), pp. 725-734.
18. Fiat, A., and Woeginger, G., Eds. On-Line Algorithms|The State of the Art. Lecture Notes in Computer Science. Springer-Verlag, 1998.
19. Irani, S. Randomized weighted caching with two page weights. Manuscript, 1999.
20. Karlin, A., Manasse, M., McGeoch, L., and Owicki, S. Competitive random-ized algorithms for nonuniform problems. Algorithmica 11, 6 (Jun 1994), 542-571.
21. Karloff, H., Rabani, Y., and Ravid, Y. Lower bounds for randomized k-server and motion-planning algorithms. SIAM Journal on Computing 23, 2 (Apr 1994), 293-312.
22. Koutsoupias, E., and Papadimitriou, C. On the k-server conjecture. Journal of the ACM 42 (1995), 971-983.
23. Koutsoupias, E., and Papadimitriou, C. The 2-evader problem. Information Processing Letters 57, 5 (Mar 1996), 249-252.
24. Manasse, M., McGeoch, L., and Sleator, D. Competitive algorithms for server problems. Journal of Algorithms 11, 2 (Jun 1990), 208-230.
25. McGeoch, L., and Sleator, D. A strongly competitive randomized paging algorithm. Algorithmica 6, 6 (1991), 816-825.
26. Seiden, S. S. Unfair problems and randomized algorithms for metrical task sys-tems. Information and Computation 148, 2 (Feb 1999), 219-240.
27. Sleator, D., and Tarjan, R. Amortized efficiency of list update and paging rules. Communications of the ACM 28, 2 (Feb 1985), 202-208.