Metrical task systems and the k-server problem on HSTs

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

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 287-298

  Bansal, Nikhil ^a   Buchbinder, Niv ^b   Naor, Joseph Seffi ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ALGORITHMS; HIERARCHICALLY SEPARATED TREES; K-SERVER; K-SERVER PROBLEM; METRIC SPACES; METRICAL TASK SYSTEMS; ON-LINE ALGORITHMS; PRIMAL-DUAL APPROACH; TECHNICAL CONTRIBUTION;

BINARY TREES; LINGUISTICS; TOPOLOGY; TRANSLATION (LANGUAGES); TREES (MATHEMATICS);

SERVERS;

EID: 77955317161     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_25     Document Type: Conference Paper

References (27)

1. Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theory Computer Science 234 (1- 2), 203-218 (2000)
2. Bansal, N., Buchbinder, N., Naor, J. S.: A primal-dual randomized algorithm for weighted paging. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 507-517 (2007)
3. Bansal, N., Buchbinder, N., Naor, S.: Towards the randomized k-server conjecture: A primaldual approach. In: ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 (to appear, 2010)
4. Bansal, N., Buchbinder, N., Naor, J. (S).: Randomized competitive algorithms for generalized caching. In: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 235-244 (2008)
5. Bartal, Y., Blum, A., Burch, C., Tomkins, A.: A polylog (n)-competitive algorithm for metrical task systems. In: Proceedings of the 29th Annual ACM Symposium on Theory of computing, pp. 711-719 (1997)
6. Blum, A.: Personal communication
7. Blum, A., Burch P. C.: On-line learning and the metrical task system problem. Machine Learning 39 (1), 35-58 (2000)
8. Blum, A., Burch, C., Kalai, A.: Finely-competitive paging. In: IEEE Symposium on Foundations of Computer Science, pp. 450-458 (1999)
9. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)
10. Borodin, A., Linial, N., Saks, M. E.: An optimal on-line algorithm for metrical task system. Journal of the ACM 39 (4), 745-763 (1992)
11. Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing problems. In: Proceedings of the 13th Annual European Symposium on Algorithms (2005)
12. Buchbinder, N., Naor, J.: The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science 3 (2- 3), 93-263 (2009)
13. Chrobak, M., Karloff, H., Payne, T., Vishwanathan, S.: New results on server problems. SIAM Journal on Discrete Math 4 (2), 172-181 (1991)
14. Chrobak, M., Larmore, L.: An optimal on-line algorithm for k-servers on trees. SIAM Journal on Computing 20 (1), 144-148 (1991)
15. Coté, A., Meyerson, A., Poplawski, L.: Randomized k-server on hierarchical binary trees. In: STOC 2008: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 227-234 (2008)
16. Csaba, B., Lodha, S.: A randomized on-line algorithm for the k-server problem on a line. Random Structures and Algorithms 29 (1), 82-104 (2006)
17. Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., Young, N. E.: Competitive paging algorithms. Journal of Algorithms 12 (4), 685-699 (1991)
18. Fiat, A., Mendel, M.: Better algorithms for unfair metrical task systems and applications. SIAM Journal on Computing 32 (6), 1403-1422 (2003)
19. Fiat, A., Mendel, M.: Better algorithms for unfair metrical task systems and applications. SIAM Journal on Computing 32 (6), 1403-1422 (2003)
20. Irani, S.: Randomized weighted caching with two page weights. Algorithmica 32 (4), 624-640 (2002)
21. Irani, S.: Page replacement with multi-size pages and applications to web caching. In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 701-710 (1997)
22. Kleinberg, J. M., Tardos, É.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. J. ACM 49 (5), 616-639 (2002)
23. Koutsoupias, E., Papadimitriou, C. H.: On the k-server conjecture. Jornal of the ACM 42 (5), 971-983 (1995)
24. Manasse, M. S., McGeoch, L. A., Sleator, D. D.: Competitive algorithms for server problems. Journal of Algorithms 11 (2), 208-230 (1990)
25. Meyerson, A.: http://www.cs.ucla.edu/~awm/talks/kserver.ppt
26. Seiden, S. S.: A general decomposition theorem for the k-server problem. In: Proceedings of the 9th Annual European Symposium on Algorithms, pp. 86-97 (2001)
27. Sleator, D. D., Tarjan, R. E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28 (2), 202-208 (1985)