Skip to main content
SpringerLink
Log in

Metrical task systems, the server problem and the work function algorithm

  • Chapter
  • First Online:
Online Algorithms

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1442))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Information and Computation, 106(2):234–252, 1993. Preliminary version in Proc. 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 318, Springer-Verlag, Berlin, 1988, 176–189. Also Tech. Report CS-87-68, University of Waterloo, Department of Computer Science, October, 1987.

    Article  Google Scholar 

  2. Y. Bartal and E. Grove. The harmonic k-server algorithm is competitive. To appear in Journal of ACM, 1994.

    Google Scholar 

  3. P. Berman, H. Karloff, and G. Tardos. A competitive algorithm for three servers. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 280–290, 1990.

    Google Scholar 

  4. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Proc. 19th Annual ACM Symposium on Theory of Computing, pages 373–382, 1987.

    Google Scholar 

  5. W. Burley. Traversing layered graphs using the work function algorithm. Technical Report CS93-319, Department of Computer Science and Engineering, University of California at San Diego, 1993.

    Google Scholar 

  6. M. Chrobak, H. Karloff, T. H. Payne, and S. Vishwanathan. New results on server problems. SIAM Journal on Discrete Mathematics, 4:172–181, 1991. Also in Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, pp. 291–300.

    Google Scholar 

  7. M. Chrobak and L. L. Larmore. A new approach to the server problem. SIAM Journal on Discrete Mathematics, 4:323–328, 1991.

    Article  Google Scholar 

  8. M. Chrobak and L. L. Larmore. An optimal online algorithm for k servers on trees. SIAM Journal on Computing, 20:144–148, 1991.

    Article  Google Scholar 

  9. M. Chrobak and L. L. Larmore. Metrical service systems: Deterministic strategies. Technical Report UCR-CS-93-1, Department of Computer Science, University of California at Riverside, 1992. Submitted for publication in a journal.

    Google Scholar 

  10. M. Chrobak and L. L. Larmore. The server problem and on-line games. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 7, pages 11–64, 1992.

    Google Scholar 

  11. M. Chrobak and L. L. Larmore. Generosity helps or an 11-competitive algorithm for three servers. Journal of Algorithms, 16:234–263, 1994. Also in Proceedings of ACM/SIAM Symposium on Discrete Algorithms, 1992, 196–202.

    Article  Google Scholar 

  12. X. Deng and C. Papadimitriou. Exploring an unknown graph. In Proc. 31st IEEE Symp. Foundations of Computer Science, pages 355–361, 1990.

    Google Scholar 

  13. A. Fiat, D. Foster, H. Karloff, Y. Rabani, Y. Ravid, and S. Vishwanathan. Competitive algorithms for layered graph traversal. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pages 288–297, 1991.

    Google Scholar 

  14. A. Fiat, Y. Rabani, and Y. Ravid. Competitive k-server algorithms. In Proc. 22nd IEEE Symposium on Foundations of Computer Science, pages 454–463, 1990.

    Google Scholar 

  15. E. Grove. The harmonic k-server algorithm is competitive. In Proc. 23rd ACM Symposium on Theory of Computing, pages 260–266, 1991.

    Google Scholar 

  16. E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. In Proc. 25th Symposium on Theory of Computing, pages 507–511, 1994.

    Google Scholar 

  17. E. Koutsoupias and C. Papadimitriou. The 2-evader problem. Information Processing Letters, 57:249–252, 1996.

    Google Scholar 

  18. M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for online problems. In Proc. 20th Annual ACM Symposium on Theory of Computing, pages 322–333, 1988.

    Google Scholar 

  19. M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208–230, 1990.

    Article  Google Scholar 

  20. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. In 16th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science vol. 372, pages 610–620. Springer-Verlag, 1989.

    Google Scholar 

  21. H. Ramesh. On traversing layered graphs on-line. In Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 412–421, 1993.

    Google Scholar 

Download references

Authors
  1. Marek Chrobak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lawrence L. Larmore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Amos Fiat Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chrobak, M., Larmore, L.L. (1998). Metrical task systems, the server problem and the work function algorithm. In: Fiat, A., Woeginger, G.J. (eds) Online Algorithms. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029565

Download citation

  • DOI: https://doi.org/10.1007/BFb0029565

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64917-5

  • Online ISBN: 978-3-540-68311-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation