Almost-optimal deterministic treasure hunt in arbitrary graphs
From MaRDI portal
Cites work
- A correction to: ``Agent searching in a tree and the optimality of iterative deepening
- Agent searching in a tree and the optimality of iterative deepening
- Competitive Online Approximation of the Optimal Search Ratio
- Competitive search in symmetric trees
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
- scientific article; zbMATH DE number 6297684 (Why is no real title available?)
- Infinite linear programming and online searching with turn cost
- Lower bounds in on-line geometric searching
- On the linear search problem
- On the two-dimensional cow search problem
- Online algorithms for searching and exploration in the plane
- Online searching with turn cost
- Optimal constrained graph exploration
- Piecemeal graph exploration by a mobile robot.
- Reaching a target in the plane with no information
- Search games: a review
- Searching for an axis-parallel shoreline
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- The theory of search games and rendezvous.
- The ultimate strategy to search on \(m\) rays?
- Treasure hunt with advice
- Yet more on the linear search problem
This page was built for publication: Almost-optimal deterministic treasure hunt in arbitrary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241133)
