How Much Information about the Future Is Needed?
From MaRDI portal
Publication:5448651
DOI10.1007/978-3-540-77566-9_21zbMath1132.68422OpenAlexW1570791521MaRDI QIDQ5448651
Stefan Dobrev, Rastislav Královič, Dana Pardubská
Publication date: 7 March 2008
Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_21
Related Items
On the Power of Randomness versus Advice in Online Computation ⋮ Call admission problems on grids with advice ⋮ Two-way and one-way quantum and classical automata with advice for online minimization problems ⋮ Improved analysis of the online set cover problem with advice ⋮ Online Matching in Regular Bipartite Graphs ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ Advice Complexity of Fine-Grained Job Shop Scheduling ⋮ On Usefulness of Information: Framework and NFA Case ⋮ Fully Online Matching with Advice on General Bipartite Graphs and Paths ⋮ Online knapsack with removal and recourse ⋮ Reordering buffer management with advice ⋮ Advice Complexity and Barely Random Algorithms ⋮ Online coloring of bipartite graphs with and without advice ⋮ 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 Advice Complexity of the k-Server Problem ⋮ On the list update problem with advice ⋮ On the advice complexity of the online dominating set problem ⋮ Online algorithms with advice: the tape model ⋮ Online computation with advice ⋮ Advice Complexity and Barely Random Algorithms ⋮ 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 ⋮ Exploring sparse graphs with advice
