Online Graph Exploration with Advice
From MaRDI portal
Publication:2913217
DOI10.1007/978-3-642-31104-8_23zbMath1504.68162WikidataQ57310484 ScholiaQ57310484MaRDI QIDQ2913217
Stefan Dobrev, Euripides Markou, Rastislav Královič
Publication date: 26 September 2012
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31104-8_23
68R10: Graph theory (including graph drawing) in computer science
68W27: Online algorithms; streaming algorithms
Related Items
Online bin packing with advice, Lower and upper competitive bounds for online directed graph exploration, On the advice complexity of online bipartite matching and online stable marriage, On the advice complexity of the \(k\)-server problem under sparse metrics, Online graph exploration algorithms for cycles and trees by multiple searchers, 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, Treasure Hunt with Advice