A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
From MaRDI portal
Publication:1679508
DOI10.1007/s10878-017-0135-zzbMath1384.90080OpenAlexW2613639575MaRDI QIDQ1679508
Xiuni Wang, Wenbin Chen, Ke Qi, Fufang Li, Maobin Tang, Jian-Xiong Wang
Publication date: 9 November 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0135-z
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(k\)-server problem
- A strongly competitive randomized paging algorithm
- Competitive \(k\)-server algorithms
- Competitive analysis of randomized paging algorithms
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- The online \(k\)-server problem with max-distance objective
- On online algorithms with advice for the \(k\)-server problem
- On metric Ramsey-type phenomena
- An Optimal On-Line Algorithm for K Servers on Trees
- Randomized Memoryless Algorithms for the Weighted and the Generalized k -server Problems
- Competitive algorithms for server problems
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- Metrical Task Systems and the k-Server Problem on HSTs
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Competitive paging algorithms
- On the k -server conjecture
- A Primal-Dual Randomized Algorithm for Weighted Paging
- Algorithms – ESA 2005
- A randomized on–line algorithm for the k–server problem on a line
- The harmonic k -server algorithm is competitive
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
