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

A fast approximate implementation of the work function algorithm for solving the $$k$$ k -server problem

Author

Listed:
  • Tomislav Rudec
  • Robert Manger

Abstract

In this paper we propose an approximate implementation of the work function algorithm (WFA) for solving the $$k$$ 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. Copyright Springer-Verlag Berlin Heidelberg 2015

Suggested Citation

  • 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.
    • Handle: RePEc:spr:cejnor:v:23:y:2015:i:3:p:699-722
    DOI: 10.1007/s10100-014-0349-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-014-0349-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-014-0349-4?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.

    References listed on IDEAS

    as
    1. 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.
    Full references (including those not matched with items on IDEAS)

    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. Tibor Csendes & Lidija Zadnik Stirn & Janez Žerovnik, 2015. "Editorial," 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 523-525, September.
    3. Andrej Kastrin & Janez Povh & Lidija Zadnik Stirn & Janez Žerovnik, 2021. "Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR," 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. 29(3), pages 773-790, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    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.

    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:23:y:2015:i:3:p:699-722. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.