Improved Bounds for the Symmetric Rendezvous Value on the Line
DOI10.1287/OPRE.1070.0439zbMATH Open1167.91322DBLPjournals/ior/HanDVZ08OpenAlexW2099943113WikidataQ58051162 ScholiaQ58051162MaRDI QIDQ3392207FDOQ3392207
Authors: Qiaoming Han, Luis Fernando Zuluaga, Donglei Du, Juan Vera
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1070.0439
Recommendations
- scientific article; zbMATH DE number 6381633
- Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Symmetric improvements of Liouville's inequality
- Lower Bounds on the SymmetricL2-Discrepancy and Their Application
- An improved point-line incidence bound over arbitrary fields
- scientific article; zbMATH DE number 2085199
- An improved bound in Wirsing's problem
- scientific article; zbMATH DE number 1522533
- An improved upper-bound for Rivest et al.'s half-lie problem
Search theory (90B40) Semidefinite programming (90C22) Positional games (pursuit and evasion, etc.) (91A24)
Cited In (9)
- Deterministic symmetric rendezvous with tokens in a synchronous torus
- A symbolic programming approach to the rendezvous search problem
- Rendezvous problem
- Search-and-rescue rendezvous
- Rendezvous search with markers that can be dropped at chosen times
- Title not available (Why is that?)
- Ten Open Problems in Rendezvous Search
- Optimal trade-off between speed and acuity when searching for a small object
- Rendezvous Search with Revealed Information: Applications to the Line
Uses Software
This page was built for publication: Improved Bounds for the Symmetric Rendezvous Value on the Line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392207)