On Online Algorithms with Advice for the k-Server Problem

DOI10.1007/978-3-642-29116-6_17zbMath1242.68380OpenAlexW1703935141MaRDI QIDQ2896390

Adi Rosén, Marc P. Renault

Publication date: 16 July 2012

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29116-6_17

zbMATH Keywords

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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (13)

Treasure Hunt with Advice ⋮ Disjoint Path Allocation with Sublinear Advice ⋮ On Energy-Efficient Computations With Advice ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ On the advice complexity of the \(k\)-server problem under sparse metrics ⋮ On the list update problem with advice ⋮ On the advice complexity of the online dominating set problem ⋮ On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles ⋮ The string guessing problem as a method to prove lower bounds on the advice complexity ⋮ Advice Complexity of the Online Search Problem ⋮ Towards using the history in online computation with advice ⋮ On Advice Complexity of the k-server Problem under Sparse Metrics ⋮ Online bin packing with advice

This page was built for publication: On Online Algorithms with Advice for the k-Server Problem