Rendezvous search on labeled networks
From MaRDI portal
Publication:4533473
DOI10.1002/nav.10011zbMath1008.91011OpenAlexW2071069929MaRDI QIDQ4533473
Publication date: 11 June 2002
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10011
Search theory (90B40) Deterministic network models in operations research (90B10) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (27)
A symbolic programming approach to the rendezvous search problem ⋮ Social distancing, gathering, search games: mobile agents on simple networks ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous in networks in spite of delay faults ⋮ Price of asynchrony in mobile agents computing ⋮ Rendezvous search on a star graph with examination costs ⋮ Almost universal anonymous rendezvous in the plane ⋮ Fast rendezvous with advice ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Ten Open Problems in Rendezvous Search ⋮ A common notion of clockwise can help in planar rendezvous ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ How to meet in anonymous network ⋮ The kissing problem: how to end a gathering when everyone kisses everyone else goodbye ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Search-and-rescue rendezvous ⋮ Line-of-sight rendezvous ⋮ Time versus space trade-offs for rendezvous in trees ⋮ How to meet asynchronously at polynomial cost ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Deterministic rendezvous with different maps ⋮ On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks
Cites Work
- Asymmetric rendezvous search on the circle
- Rendezvous Search on the Interval and the Circle
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Note: Two rendezvous search problems on the line
- Searching for targets who want to be found
- Rendezvous Search on the Line
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Indistinguishable Players
- Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
This page was built for publication: Rendezvous search on labeled networks
