Skip to main content
SpringerLink
Log in

On the Additive Constant of the k-Server Work Function Algorithm

  • Conference paper
Approximation and Online Algorithms (WAOA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5893))

Included in the following conference series:

Abstract

We consider the Work Function Algorithm for the k-server problem [2,4]. We show that if the Work Function Algorithm is c-competitive, then it is also strictly (2c)-competitive. As a consequence of [4] this also shows that the Work Function Algorithm is strictly (4k − 2)-competitive.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  Google Scholar 

  2. Chrobak, M., Larmore, L.L.: The server problem and on-line games. In: On-line algorithms: Proc. of a DIMACS Workshop. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 7, pp. 11–64 (1991)

    Google Scholar 

  3. Emek, Y., Fraigniaud, P., Korman, A., Rosén, A.: Online computation with advice. To appear in ICALP (2009)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. Journal of Algorithms 11, 208–230 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tel Aviv University, Tel Aviv, 69978, Israel

    Yuval Emek

  2. CNRS and University Paris Diderot, France

    Pierre Fraigniaud & Amos Korman

  3. CNRS and University of Paris 11, France

    Adi Rosén

Authors
  1. Yuval Emek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amos Korman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Adi Rosén
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Place des Terasses, Tour Evry 2, 91000, Evry Cedex, France

    Evripidis Bampis

  2. Institute for Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Emek, Y., Fraigniaud, P., Korman, A., Rosén, A. (2010). On the Additive Constant of the k-Server Work Function Algorithm. In: Bampis, E., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2009. Lecture Notes in Computer Science, vol 5893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12450-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12450-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12449-5

  • Online ISBN: 978-3-642-12450-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation