Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
From MaRDI portal
Publication:6075758
DOI10.1145/3588437arXiv2010.14916OpenAlexW4327814720MaRDI QIDQ6075758
Andrzej Pelc, Sébastien Bouchard, Arnaud Labourel, Yoann Dieudonné
Publication date: 23 October 2023
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.14916
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Searching for an axis-parallel shoreline
- Online algorithms for searching and exploration in the plane
- Infinite linear programming and online searching with turn cost
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- On the two-dimensional cow search problem
- Agent searching in a tree and the optimality of iterative deepening
- The theory of search games and rendezvous.
- Reaching a target in the plane with no information
- Piecemeal graph exploration by a mobile robot.
- A correction to: ``Agent searching in a tree and the optimality of iterative deepening
- Deterministic treasure hunt in the plane with angular hints
- Online searching with turn cost
- On the linear search problem
- Yet more on the linear search problem
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Optimal constrained graph exploration
- Search Games: A Review
- Treasure Hunt with Advice
- Competitive Online Approximation of the Optimal Search Ratio
- Competitive Search in Symmetric Trees
- Lower bounds in on-line geometric searching
- The ultimate strategy to search on \(m\) rays?
