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

Yinfeng Xu (), Hongmei Li (), Changzheng He and Li Luo
Additional contact information
Yinfeng Xu: Sichuan University
Hongmei Li: Sichuan University
Changzheng He: Sichuan University
Li Luo: Sichuan University

Journal of Combinatorial Optimization, 2015, vol. 29, issue 4, No 11, 836-846

Abstract: 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.

Keywords: Deterministic online algorithms; $$k$$ k -Server; Maximum distance (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9621-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9621-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9621-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().