A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
type: Item
instance of: scholarly article
title: A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
zbMATH Open document ID: 1384.90080
author: Wenbin Chen
author: Fufang Li
author: Ke Qi
author: Maobin Tang
author: Xiuni Wang
author: Jian-Xiong Wang
published in: Journal of Combinatorial Optimization
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6804420
zbMATH Keywords: \(k\)-server problem
zbMATH Keywords: online algorithm
zbMATH Keywords: primal-dual method
zbMATH Keywords: randomized algorithm
MaRDI profile type: Publication
full work available at URL: s10878-017-0135-z
OpenAlex ID: W2613639575
cites work: Competitive analysis of randomized paging algorithms
cites work: A Polylogarithmic-Competitive Algorithm for the k-Server Problem
cites work: A Primal-Dual Randomized Algorithm for Weighted Paging
cites work: Metrical Task Systems and the k-Server Problem on HSTs
cites work: Q5417604
cites work: Q4542533
cites work: The harmonic k -server algorithm is competitive
cites work: On the competitive ratio of the work function algorithm for the \(k\)-server problem
cites work: On metric Ramsey-type phenomena
cites work: On online algorithms with advice for the \(k\)-server problem
cites work: Q4230341
cites work: Q4223058
cites work: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
cites work: Algorithms – ESA 2005
cites work: A randomized on–line algorithm for the k–server problem on a line
cites work: The Design of Competitive Online Algorithms via a Primal—Dual Approach
cites work: Randomized Memoryless Algorithms for the Weighted and the Generalized k -server Problems
cites work: An Optimal On-Line Algorithm for K Servers on Trees
cites work: Q3549706
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: Competitive paging algorithms
cites work: Competitive \(k\)-server algorithms
cites work: The \(k\)-server problem
cites work: On the k -server conjecture
cites work: Competitive algorithms for server problems
cites work: A strongly competitive randomized paging algorithm
cites work: The online \(k\)-server problem with max-distance objective
DOI: 10.1007/S10878-017-0135-Z
description: scientific article; zbMATH DE number 6804420