Finding Your Kids When They Are Lost
From MaRDI portal
Publication:4014325
DOI10.1057/jors.1992.89zbMath0775.90242OpenAlexW1975690872MaRDI QIDQ4014325
Publication date: 5 October 1992
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.89
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Search theory (90B40)
Related Items (14)
Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous of three agents on the line ⋮ Rendezvous in networks in spite of delay faults ⋮ Fast rendezvous with advice ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Many-player rendezvous search: Stick together or split and meet? ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Time versus space trade-offs for rendezvous in trees ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Coordinated search for an object hidden on the line ⋮ Rendezvous search on the line with bounded resources: Expected time minimization ⋮ Unnamed Item
This page was built for publication: Finding Your Kids When They Are Lost
