Ten Open Problems in Rendezvous Search
From MaRDI portal
Publication:2961406
DOI10.1007/978-1-4614-6825-7_14zbMath1356.91014MaRDI QIDQ2961406
Publication date: 20 February 2017
Published in: Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_14
Related Items
Algorithms for \(p\)-Faulty Search on a half-line, Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract), Evacuating from \(\ell_p\) unit disks in the wireless model, God save the queen
Cites Work
- Unnamed Item
- Unnamed Item
- Rendezvous search on a star graph with examination costs
- How to meet in anonymous network
- The theory of search games and rendezvous.
- Asymmetric rendezvous search on the circle
- Asynchronous deterministic rendezvous in graphs
- Line-of-sight rendezvous
- Deterministic rendezvous in graphs
- Rendezvous Search on the Interval and the Circle
- Optimal Symmetric Rendezvous Search on Three Locations
- Improved Bounds for the Symmetric Rendezvous Value on the Line
- Mobile Agent Rendezvous in a Synchronous Torus
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Rendezvous Search: A Personal Perspective
- Note: Two rendezvous search problems on the line
- Rendezvous Search on the Line with More Than Two Players
- Rendezvous of three agents on the line
- Rendezvous search on labeled networks
- Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
- Minimax Rendezvous on the Line
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
- Rendezvous Search with Revealed Information: Applications to the Line
- Principles of Distributed Systems
- The rendezvous problem on discrete locations
- Alternating search at two locations
