A new upper bound on the work function algorithm for the \(k\)-server problem

DOI10.1007/s10878-019-00493-zzbMath1434.90174OpenAlexW2991644895WikidataQ126658342 ScholiaQ126658342MaRDI QIDQ2292157

Yongxi Cheng, Wen-Ming Zhang

Publication date: 3 February 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00493-z

zbMATH Keywords

competitive analysison-line algorithms\(k\)-server problemwork function

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

The work function algorithm for the paging problem ⋮ Managing multiple mobile resources

Cites Work

• A fast work function algorithm for solving the \(k\)-server problem
• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
• The \(k\)-server problem
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• On the k -server conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: A new upper bound on the work function algorithm for the \(k\)-server problem