Skip to main content
SpringerLink
Log in

A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

In this paper we propose an approximate implementation of the work function algorithm (WFA) for solving the \(k\)-server problem. Our implementation is based on network flow techniques, a novel network model, and flow cost reduction. Also, it is provided with a parameter that enables tradeoff between accuracy and speed. In the paper we present experiments, showing that the new implementation can mimic perfectly the original WFA and still run at least an order of magnitude faster than any known exact implementation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Bartal Y, Koutsoupias E (2004) On the competitive ratio of the work function algorithm for the \(k\)-server problem. Theor Comput Sci 324:337–345

    Article  Google Scholar 

  • Bazaraa MS, Jarvis JJ, Sherali HD (2004) Linear programming and network flows, 3rd edn. Wiley-Interscience, New York

    Google Scholar 

  • Borodin A, El-Yaniv R (2005) Online computation and competitive analysis. Cambridge University Press, Cambridge

    Google Scholar 

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

    Article  Google Scholar 

  • Emek Y, Fraigniaud P, Korman A, Rosen A (2011) Online computation with advice. Theor Comput Sci 412:2642–2656

    Article  Google Scholar 

  • Emek Y, Fraigniaud P, Korman A, Rosen A (2010) On the additive constant of the \(k\)-server work function algorithm. Inf Proces Lett 110:1120–1123

    Article  Google Scholar 

  • Flammini M, Nicosia G (2010) On the bicriteria \(k\)-server problem. ACM Trans Algorithms 7. Article no 6, 19 p

  • Irani S, Karlin AR (1997) Online computation. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS Publishing, Boston, pp 521–564

    Google Scholar 

  • Jungnickel D (2005) Graphs, networks and algorithms, 2nd edn. Springer, Berlin

  • Koutsoupias E, Papadimitrou C (1994) On the \(k\)-server conjecture. In: Leighton FT, Goodrich M (eds) Proceedings of the 26-th annual ACM symposium on theory of computing, Montreal, QC, Canada, May 23–25, 1994. ACM Press, New York, pp 507–511

  • Koutsoupias E (1999) Weak adversaries for the \(k\)-server problem. In: Beame P (ed) Proceedings of the 40th annual symposium on foundations of computer science, New York, USA, October 17–18, 1999. IEEE, New York, pp 444–449

  • Koutsoupias E (2009) The \(k\)-server problem. Comput Sci Rev 3:105–118

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Rudec T, Baumgartner A, Manger R (2010) Measuring true performance of the work function algorithm for solving the on-line \(k\)-server problem. J Comput Inf Technol CIT 18:361–367

    Google Scholar 

  • Rudec T, Baumgartner A, Manger R (2013) A fast work function algorithm for solving the \(k\)-server problem. Central Eur J Oper Res CEJOR 21:187–205

    Article  Google Scholar 

  • Rudec T, Manger R (2013) A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction. Comput Oper Res 40:1004–1013

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, University of Osijek, Kneza Trpimira 2b, 31000 , Osijek, Croatia

    Tomislav Rudec

  2. Department of Mathematics, University of Zagreb, Bijenička cesta 30, 10000 , Zagreb, Croatia

    Robert Manger

Authors
  1. Tomislav Rudec
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Manger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert Manger.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rudec, T., Manger, R. A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem. Cent Eur J Oper Res 23, 699–722 (2015). https://doi.org/10.1007/s10100-014-0349-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-014-0349-4

Keywords

Search

Navigation