Pages that link to "Item:Q2913217"

The following pages link to Online Graph Exploration with Advice (Q2913217):

Displaying 22 items.

• Online bin packing with advice (Q261387) (← links)
• Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
• On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
• On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
• An improved lower bound for competitive graph exploration (Q831137) (← links)
• Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
• Exploring sparse graphs with advice (Q2105435) (← links)
• Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
• Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
• Online graph exploration on trees, unicyclic graphs and cactus graphs (Q2656355) (← links)
• On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
• A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
• Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
• Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
• Treasure Hunt with Advice (Q3460725) (← links)
• (Q5002857) (← links)
• Online Minimum Spanning Tree with Advice (Q5895056) (← links)
• Advice complexity of adaptive priority algorithms (Q6180750) (← links)
• Online search with a hint (Q6186319) (← links)
• Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
• An improved upper bound for the online graph exploration problem on unicyclic graphs (Q6621840) (← links)
• Energy constrained depth first search (Q6647777) (← links)