Advice complexity of treasure hunt in geometric terrains
From MaRDI portal
Publication:2051769
DOI10.1016/j.ic.2021.104705OpenAlexW3128170459MaRDI QIDQ2051769
Ram Narayan Yadav, Andrzej Pelc
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06823
Related Items (4)
Treasure hunt in graph using pebbles ⋮ Online search with a hint ⋮ Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Pebble guided near optimal treasure hunt in anonymous graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case optimal exploration of terrains with obstacles
- Searching for an axis-parallel shoreline
- Online computation with advice
- Trade-offs between the size of advice and broadcasting time in trees
- Local MST computation with short advice
- Searching in the plane
- Shortest paths without a map
- Communication algorithms with advice
- On the two-dimensional cow search problem
- Graph searching with advice
- Watchman routes under limited visibility
- The theory of search games and rendezvous.
- Exploring sparse graphs with advice (extended abstract)
- Reaching a target in the plane with no information
- Proof labeling schemes
- The Polygon Exploration Problem
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Online Graph Exploration with Advice
- Treasure Hunt with Advice
- Approximate distance oracles
- How to learn an unknown environment. I
- Online Navigation in a Room
- Navigating in Unfamiliar Geometric Terrain
- Labeling Schemes for Flow and Connectivity
- Distance labeling in graphs
- Deterministic Graph Exploration with Advice
- Exploring unknown environments with obstacles
This page was built for publication: Advice complexity of treasure hunt in geometric terrains
