Skip to main content
SpringerLink
Log in

Algorithm DC-Tree for k Servers on Trees

1991; Chrobak, Larmore

  • Reference work entry
Encyclopedia of Algorithms

  • 398 Accesses

Problem Definition

Figure 1
figure 1

Algorithm DC-Tree serving a request on r. The initial configuration is on the left; the configuration after the service is completed is on the right. At first, all servers are active. When server 3 reaches point x, server 1 becomes inactive. When server 3 reaches point y, server 2 becomes inactive

Full size image

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Bein, W., Chrobak, M., Larmore, L.L.: The 3‑server problem in the plane. Theor. Comput. Sci. 287, 387–391 (2002)

    Article  MathSciNet  Google Scholar 

  2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  3. Chrobak, M., Karloff, H., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM J. Discret. Math. 4, 172–181 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chrobak, M., Larmore, L.L.: An optimal online algorithm for k servers on trees. SIAM J. Comput. 20, 144–148 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  5. Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. In: Proc. 26th Symp. Theory of Computing (STOC), pp. 507–511. ACM (1994)

    Google Scholar 

  6. Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. J. ACM 42, 971–983 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Manasse, M., McGeoch, L.A., Sleator, D.: Competitive algorithms for online problems. In: Proc. 20th Symp. Theory of Computing (STOC), pp. 322–333. ACM (1988)

    Google Scholar 

  8. Manasse, M., McGeoch, L.A., Sleator, D.: Competitive algorithms for server problems. J. Algorithms 11, 208–230 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Riverside, CA, USA

    Marek Chrobak

Authors
  1. Marek Chrobak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Chrobak, M. (2008). Algorithm DC-Tree for k Servers on Trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_7

Download citation

Publish with us

Policies and ethics

Search

Navigation