On online algorithms with advice for the \(k\)-server problem

DOI10.1007/s00224-012-9434-zzbMath1328.68317OpenAlexW2077692046MaRDI QIDQ2344207

Marc P. Renault, Adi Rosén

Publication date: 12 May 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9434-z

zbMATH Keywords

competitive analysisonline algorithms\(k\)-server problemonline computation with advice

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (9)

Online Bin Packing with Advice of Small Size ⋮ Online algorithms with advice for the dual bin packing problem ⋮ On the advice complexity of the \(k\)-server problem ⋮ A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs ⋮ Reordering buffer management with advice ⋮ Online algorithms with advice for bin packing and scheduling problems ⋮ The \(k\)-server problem with advice in \(d\) dimensions and on the sphere ⋮ Online algorithms with advice: the tape model ⋮ Online bin packing with advice of small size

Cites Work

• Unnamed Item
• Online computation with advice
• On embedding trees into uniformly convex Banach spaces
• On the Advice Complexity of the k-Server Problem
• Advice Complexity and Barely Random Algorithms
• Information Complexity of Online Problems
• On the Advice Complexity of Online Problems
• An optimal on-line algorithm for metrical task system
• How Much Information about the Future Is Needed?

This page was built for publication: On online algorithms with advice for the \(k\)-server problem