On the additive constant of the k-server work function algorithm

DOI10.1016/J.IPL.2010.09.003MaRDI QIDQ1675878zbMATH OpenOpenAlexFDO

Authors Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén

Publication date 3 November 2017

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.09.003

zbMATH Keywords

online algorithms\(k\)-server problem

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Recommendations

• On the additive constant of the \(k\)-server work function algorithm
• scientific article; zbMATH DE number 1528669
• The design and analysis of a modified work function algorithm for solving the on-line \(k\)-server problem
• On the k -server conjecture
• A new upper bound on the work function algorithm for the \(k\)-server problem

Cites work

• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Competitive algorithms for server problems
• On the k -server conjecture
• Online Computation with Advice

Cited in

(3)

• A fast approximate implementation of the work function algorithm for solving the k-server problem
• On the additive constant of the \(k\)-server work function algorithm
• scientific article; zbMATH DE number 1528669 (Why is no real title available?)

This page was built for publication: On the additive constant of the \(k\)-server work function algorithm

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