Centre for Discrete and Applicable Mathematics |
|
CDAM Research Report, LSE-CDAM-2000-05May 2000 |
Steve Alpern
Abstract
The rendezvous search problem asks how two unit speed players can find each other in least expected time when randomly placed in a known region. This article surveys recent work on rendezvous search and its offshoots, from the perspective of one of its founders.
A compressed (gzip) PostScript file (160 kB) with the full contents of this report can be downloaded by clicking here.
Alternatively, if you like a free hard copy of this report, please send the number of this report, LSE-CDAM-2000-05, together with your name and postal address to:
CDAM Research Reports Series Centre for Discrete and Applicable Mathematics London School of Economics Houghton Street London WC2A 2AE, U.K. |
||
Phone: +44(0)-20-7955 7732. Fax: +44(0)-20-7955 6877. Email: info@maths.lse.ac.uk |
Introduction to the CDAM Research Report Series. | ||
CDAM Homepage. |
Last changed: Wed 9 Feb 2005
For comments go to:
http://www.maths.lse.ac.uk/webmaster.html.