Rendezvous Search on the Line
From MaRDI portal
Publication:4545661
DOI10.1287/opre.47.6.974zbMath1042.91517OpenAlexW2034224690MaRDI QIDQ4545661
Publication date: 1999
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.6.974
Related Items (26)
A symbolic programming approach to the rendezvous search problem ⋮ Attribute-efficient learning of Boolean functions from Post closed classes ⋮ Social distancing, gathering, search games: mobile agents on simple networks ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous of three agents on the line ⋮ Rendezvous search on labeled networks ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ A common notion of clockwise can help in planar rendezvous ⋮ On deterministic rendezvous at a node of agents with arbitrary velocities ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ How to meet in anonymous network ⋮ 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 ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Equilibria of two-sided matching games with common preferences ⋮ 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 ⋮ Anonymous meeting in networks
This page was built for publication: Rendezvous Search on the Line
