Pebble guided near optimal treasure hunt in anonymous graphs
From MaRDI portal
Publication:2117728
DOI10.1007/978-3-030-79527-6_13OpenAlexW3173504024MaRDI QIDQ2117728
Kaushik Mondal, Supantha Pandit, Himadri Nayak, Barun Gorain
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.05933
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Searching for an axis-parallel shoreline
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- How many ants does it take to find the food?
- On the two-dimensional cow search problem
- The theory of search games and rendezvous.
- Advice complexity of treasure hunt in geometric terrains
- Deterministic treasure hunt in the plane with angular hints
- Online searching with turn cost
- Yet more on the linear search problem
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Deterministic Graph Exploration with Advice
- Label-guided graph exploration by a finite automaton
- Searching a Tree with Permanently Noisy Advice
- Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
- Unnamed Item
- Unnamed Item
This page was built for publication: Pebble guided near optimal treasure hunt in anonymous graphs
