On the Advice Complexity of the k-Server Problem
From MaRDI portal
Publication:3012806
DOI10.1007/978-3-642-22006-7_18zbMath1332.68291OpenAlexW1731888680MaRDI QIDQ3012806
Rastislav Královič, Dennis Komm, Richard Královič, Hans-Joachim Böckenhauer
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_18
Related Items (37)
Online makespan minimization with parallel schedules ⋮ On the Power of Randomness versus Advice in Online Computation ⋮ Online Bin Packing with Advice of Small Size ⋮ Online Multi-Coloring with Advice ⋮ Treasure Hunt with Advice ⋮ Disjoint Path Allocation with Sublinear Advice ⋮ On Energy-Efficient Computations With Advice ⋮ On the advice complexity of the \(k\)-server problem ⋮ The ANTS problem ⋮ Improved analysis of the online set cover problem with advice ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ On the advice complexity of online bipartite matching and online stable marriage ⋮ The advice complexity of a class of hard online problems ⋮ Fully Online Matching with Advice on General Bipartite Graphs and Paths ⋮ The secretary problem with reservation costs ⋮ Reordering buffer management with advice ⋮ The online knapsack problem: advice and randomization ⋮ Online node- and edge-deletion problems with advice ⋮ Online algorithms with advice for bin packing and scheduling problems ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ The \(k\)-server problem with advice in \(d\) dimensions and on the sphere ⋮ 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 ⋮ Online algorithms with advice: the tape model ⋮ Advice complexity of priority algorithms ⋮ 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 ⋮ Online bin packing with advice of small size ⋮ Towards using the history in online computation with advice ⋮ On online algorithms with advice for the \(k\)-server problem ⋮ Advice complexity of maximum independent set in sparse and bipartite graphs ⋮ On Advice Complexity of the k-server Problem under Sparse Metrics ⋮ Online multi-coloring with advice ⋮ Online bin packing with advice
Cites Work
This page was built for publication: On the Advice Complexity of the k-Server Problem
