Rendezvous search on the line
成果类型：
Article
署名作者：
Gal, S
署名单位：
University of Haifa
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.47.6.974
发表日期：
1999
页码：
974-976
关键词：
摘要：
We present two new results for the asymmetric rendezvous problem on the line. We first show that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. Then we consider the meeting One of n-players in the worst case and show that it has an asymptotic behavior of n/2 + O(log n).