IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v21y2013i1p187-205.html
   My bibliography  Save this article

A fast work function algorithm for solving the k-server problem

Author

Listed:
  • Tomislav Rudec
  • Alfonzo Baumgartner
  • Robert Manger

Abstract

This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. The paper addresses some practical aspects of the WFA, such as its efficient implementation and its true quality of serving. First, an implementation of the WFA is proposed, which is based on network flows, and which reduces each step of the WFA to only one minimal-cost maximal flow problem instance. Next, it is explained how the proposed implementation can further be simplified if the involved metric space is finite. Also, it is described how actual computing of optimal flows can be speeded up by taking into account special properties of the involved networks. Some experiments based on the proposed implementation and improvements are presented, where actual serving costs of the WFA have been measured on very large problem instances and compared with costs of other algorithms. Finally, suitability of the WFA for solving real-life problems is discussed. Copyright Springer-Verlag 2013

Suggested Citation

  • Tomislav Rudec & Alfonzo Baumgartner & Robert Manger, 2013. "A fast work function algorithm for solving the k-server problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 187-205, January.
    • Handle: RePEc:spr:cejnor:v:21:y:2013:i:1:p:187-205
    DOI: 10.1007/s10100-011-0222-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-011-0222-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-011-0222-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wenming Zhang & Yongxi Cheng, 2020. "A new upper bound on the work function algorithm for the k-server problem," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 509-518, February.
    2. Bertsimas, Dimitris & Jaillet, Patrick & Korolko, Nikita, 2019. "The K-server problem via a modern optimization lens," European Journal of Operational Research, Elsevier, vol. 276(1), pages 65-78.
    3. Tomislav Rudec & Robert Manger, 2015. "A fast approximate implementation of the work function algorithm for solving the $$k$$ k -server problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(3), pages 699-722, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:21:y:2013:i:1:p:187-205. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.