Pages that link to "Item:Q3012942"
From MaRDI portal
The following pages link to Online Graph Exploration: New Results on Old and New Algorithms (Q3012942):
Displaying 13 items.
- The Canadian tour operator problem on paths: tight bounds and resource augmentation (Q326483) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Collaborative exploration of trees by energy-constrained mobile robots (Q722216) (← links)
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← 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)
- Online Graph Exploration with Advice (Q2913217) (← links)
- Economical Graph Discovery (Q2941419) (← links)
- Collaborative Exploration by Energy-Constrained Mobile Robots (Q3460728) (← links)
- Average Costs of a Graph Exploration: Upper and Lower Bounds (Q4943074) (← links)
- Collaboration Without Communication: Evacuating Two Robots from a Disk (Q5283360) (← links)