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

DOI10.1007/S10878-019-00493-ZzbMATH Open1434.90174OpenAlexW2991644895WikidataQ126658342 ScholiaQ126658342MaRDI QIDQ2292157FDOQ2292157

Authors: W. M. Zhang, Yongxi Cheng 

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

Recommendations

• scientific article; zbMATH DE number 1500547
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• scientific article; zbMATH DE number 1528669
• The 3-server problem in the plane.
• On the k -server conjecture

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• On the k -server conjecture
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• The work function algorithm for the paging problem
• Title not available (Why is that?)
• On the additive constant of the \(k\)-server work function algorithm
• Title not available (Why is that?)
• Managing multiple mobile resources
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
• On the competitive ratio of the work function algorithm for the \(k\)-server problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292157)