IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v29y2015i4d10.1007_s10878-013-9621-0.html
   My bibliography  Save this article

The online $$k$$ k -server problem with max-distance objective

Author

Listed:
  • Yinfeng Xu

    (Sichuan University
    Xi’an Jiaotong University)

  • Hongmei Li

    (Sichuan University)

  • Changzheng He

    (Sichuan University)

  • Li Luo

    (Sichuan University)

Abstract

This paper studies the online $$k$$ k -server problem with max-distance objective, i.e. minimizing the maximum distance moved among all the servers. For this objective, we prove that no deterministic online algorithm has a competitive ratio better than $$k$$ k . We also analyze several classical algorithms for two special cases and show that some algorithms do have a competitive ratio of $$k$$ k and hence optimal. Consequently, we conjecture that any metric space allows for a deterministic $$k$$ k -competitive $$k$$ k -server algorithm with max-distance objective.

Suggested Citation

  • Yinfeng Xu & Hongmei Li & Changzheng He & Li Luo, 2015. "The online $$k$$ k -server problem with max-distance objective," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 836-846, May.
    • Handle: RePEc:spr:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9621-0
    DOI: 10.1007/s10878-013-9621-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9621-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-013-9621-0?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. Wenbin Chen & Fufang Li & Jianxiong Wang & Ke Qi & Maobin Tang & Xiuni Wang, 2017. "A primal–dual online algorithm for the k-server problem on weighted HSTs," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1133-1146, November.
    2. Shanxiu Jiang & Li Luo, 2019. "Online in-time service problem with minimal server assignment," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 114-122, January.

    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:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9621-0. 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.