A primal–dual online algorithm for the k-server problem on weighted HSTs

Wenbin Chen (), Fufang Li, Jianxiong Wang, Ke Qi, Maobin Tang and Xiuni Wang
Additional contact information
Wenbin Chen: Guangzhou University
Fufang Li: Guangzhou University
Jianxiong Wang: Guangzhou University
Ke Qi: Guangzhou University
Maobin Tang: Guangzhou University
Xiuni Wang: Guangzhou University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 4, No 9, 1133-1146

Abstract: Abstract In this paper, we show that there is a $$\frac{5}{2}\ell \cdot \ln (1+k)$$ 5 2 ℓ · ln ( 1 + k ) -competitive randomized algorithm for the k-sever problem on weighted Hierarchically Separated Trees (HSTs) with depth $$\ell $$ ℓ when $$n=k+1$$ n = k + 1 where n is the number of points in the metric space, which improved previous best competitive ratio $$12 \ell \ln (1+4\ell (1+k))$$ 12 ℓ ln ( 1 + 4 ℓ ( 1 + k ) ) by Bansal et al. (FOCS, pp 267–276, 2011).

Keywords: k-server problem; Online algorithm; Primal–dual method; Randomized algorithm (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0135-z 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:34:y:2017:i:4:d:10.1007_s10878-017-0135-z

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

DOI: 10.1007/s10878-017-0135-z

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 ().