Optimal symmetric rendezvous search on three locations
From MaRDI portal
Publication:2884307
Recommendations
Cited in
(13)- Strategy for quickest second meeting of two agents in two locations
- A symbolic programming approach to the rendezvous search problem
- The rendezvous problem on discrete locations
- Social distancing, gathering, search games: mobile agents on simple networks
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Search-and-rescue rendezvous
- Rendezvous search with markers that can be dropped at chosen times
- On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph
- Ten Open Problems in Rendezvous Search
- Optimal trade-off between speed and acuity when searching for a small object
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Asymmetric rendezvous search on the circle
- Spatio-temporal dynamics of random transmission events: from information sharing to epidemic spread
This page was built for publication: Optimal symmetric rendezvous search on three locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884307)