Improved Lower Bounds for Shoreline Search
From MaRDI portal
Publication:5100947
DOI10.1007/978-3-030-54921-3_5OpenAlexW3046456013MaRDI QIDQ5100947
Rastislav Královič, Stefan Dobrev, Dana Pardubská
Publication date: 1 September 2022
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_5
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items (3)
Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ Impact of knowledge on the cost of treasure hunt in trees
Cites Work
- Searching for an axis-parallel shoreline
- On the two-dimensional cow search problem
- Search games
- The theory of search games and rendezvous.
- Parallel searching in the plane
- A Variational Problem with Constraints in Dynamic Programming
- An alternative solution to the “lost at sea” problem
- Search Theory
- A Survey of Search Theory
- The minimax path in a search for a circle in a plane
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Improved Lower Bounds for Shoreline Search
