Online Graph Exploration with Advice
From MaRDI portal
Publication:2913217
DOI10.1007/978-3-642-31104-8_23zbMath1504.68162WikidataQ57310484 ScholiaQ57310484MaRDI QIDQ2913217
Rastislav Královič, Euripides Markou, Stefan Dobrev
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
Unnamed Item, Online Minimum Spanning Tree with Advice, 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, An improved lower bound for competitive graph exploration, Advice complexity of treasure hunt in geometric terrains, Exploring sparse graphs with advice, Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs, Online graph exploration algorithms for cycles and trees by multiple searchers, Online graph exploration on trees, unicyclic graphs and cactus graphs, 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, Online Graph Coloring Against a Randomized Adversary, Treasure Hunt with Advice
