On the Advice Complexity of the k-Server Problem
From MaRDI portal
Publication:3012806
DOI10.1007/978-3-642-22006-7_18zbMath1332.68291MaRDI 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
Towards using the history in online computation with advice, Advice complexity of priority algorithms, Fully Online Matching with Advice on General Bipartite Graphs and Paths, Online bin packing with advice, On the advice complexity of online bipartite matching and online stable marriage, Online algorithms with advice for bin packing and scheduling problems, On the advice complexity of the \(k\)-server problem under sparse metrics, On the list update problem with advice, Online algorithms with advice: the tape model, 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, The advice complexity of a class of hard online problems, Reordering buffer management with advice, 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, Online node- and edge-deletion problems with advice, On the advice complexity of the online dominating set problem, Online bin packing with advice of small size, On online algorithms with advice for the \(k\)-server problem, Advice complexity of maximum independent set in sparse and bipartite graphs, Online multi-coloring with advice, Online makespan minimization with parallel schedules, On the advice complexity of the \(k\)-server problem, The ANTS problem, Improved analysis of the online set cover problem with advice, The online knapsack problem: advice and randomization, The secretary problem with reservation costs, Advice Complexity of the Online Search Problem, On Advice Complexity of the k-server Problem under Sparse Metrics, A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey, Optimal Online Edge Coloring of Planar Graphs with Advice, On the Power of Randomness versus Advice in Online Computation, Disjoint Path Allocation with Sublinear Advice, On Energy-Efficient Computations With Advice, Online Bin Packing with Advice of Small Size, Online Multi-Coloring with Advice, Treasure Hunt with Advice
Cites Work
