Two Dimensional Rendezvous Search

References

• Alpern S. The rendezvous search problem. SIAM J. Control and Optimiz. (1995) 33:673–683Crossref, Google Scholar
• Alpern S., Baston V., Essegaier S. Rendezvous search on a graph. J. Appl. Probab. (1999) 36:948–959Crossref, Google Scholar
• Alpern S., Beck A. Rendezvous search on the line with bounded resources: minimizing expected meeting time. Euro. J. Oper. Res. (1997) 101:588–597Crossref, Google Scholar
• Alpern S., Beck A. Asymmetric rendezvous search on the line is a double linear search problem. Math. Oper. Res. (1999a) 24:604–618Link, Google Scholar
• Alpern S., Beck A. Rendezvous search on the line with limited resources: maximizing the probability of meeting. Oper. Res. (1999b) 47:849–861Link, Google Scholar
• Alpern S., Gal S. Rendezvous search on the line with distinguishable players. SIAM J. Control Optimiz. (1995) 33:1270–1276Crossref, Google Scholar
• Alpern S., Howard J. V. Alternating search at two locations. Dynamics and Control (2001) . forthcomingGoogle Scholar
• Alpern S., Lim W. S. The symmetric rendezvous-evasion game. SIAM J. Control Optimiz. (1998) 36:948–959Crossref, Google Scholar
• Anderson E. J., Essegaier S. Rendezvous search on the line with indistinguishable players. SIAM J. Control Optimiz. (1995) 33:1637–1642Crossref, Google Scholar
• Anderson E. J., Weber R. R. The rendezvous problem on discrete locations. J. Appl. Probab. (1990) 28:839–851Crossref, Google Scholar
• Arkin E. M., Fekete S. P., Mitchell J. S. B. The lawnmower problem. Proc. Fifth Canadian Conference on Computational Geometry (1993) Waterloo:461–466Google Scholar
• Arkin E. M., Fekete S. P., Mitchell J. S. B. Approximation algorithms for lawn mowing and milling. Computational Geometry (2000) 17:25–50Crossref, Google Scholar
• Arora S. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proc. 37th Annual IEEE Symposium on the Foundations of Computer Science (1996) 2–12Crossref, Google Scholar
• Baeza-Yates R. A., Culberson J. C., Rawlins G. J. E. Searching in the plane. Information Comput. (1993) 106:234–252Crossref, Google Scholar
• Baston V. J. Two rendezvous search problems on the line. Naval Res. Logist. (1997) 46:335–340Crossref, Google Scholar
• Baston V. J., Gal S. Rendezvous on the line when the players' initial distance is given by an unknown probability distribution. SIAM J. Control Optimiz. (1998) 36:1880–1889Crossref, Google Scholar
• Beck A., Newman D. J. Yet more on the linear search problem. Israel J. Math. (1970) 8:419–429Crossref, Google Scholar
• Blum A., Chalasani P., Coppersmith D., Pulley-blank W. R., Raghavan P., Sudan M. The minimum latency problem. Proc. Ann. Symp. Theo. Comp. (STOC) (1994) 163–171Crossref, Google Scholar
• Gal S.Search Games (1980) (Academic Press, New York) Google Scholar
• Gal S., Chudnovsky D. V., Chudnovsky G. V. Continuous search games. Search Theory (1989) 112(Marcel Dekker, New York) Lecture Notes in Pure and Applied MathematicsGoogle Scholar
• Gal S. Rendezvous search on the line. Oper. Res. (1999) 47:974–976Link, Google Scholar
• Gluss B. The minmax path in the search for a circle in the plane. Naval Res. Logist. Quart. (1961) 8:357–360Crossref, Google Scholar
• Goemans M. X., Kleinberg J. An improved approximation ratio for the minimum latency problem. Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (1996) 152–158Google Scholar
• Healey T. Journeys (sometimes) end in lovers meeting. Ann. Improbable Res. (1997) 3:26–27Google Scholar
• Howard J. V. Rendezvous search on the interval and the circle. Oper. Res. (1999) 47:550–558Link, Google Scholar
• Lim W. S., Alpern S. Minimax rendezvous search on the line. SIAM J. Control Optimiz. (1996) 34:1650–1665Crossref, Google Scholar
• Lim W. S., Alpern S. Minimax triple rendezvous on the line: corrections and extensions. (1997) . Technical Report, London School of EconomicsGoogle Scholar
• Lim W. S., Alpern S., Beck A. Rendezvous search on the line with more than two players. Oper. Res. (1997) 45:357–364Link, Google Scholar
• Mitchell J. S. B. Guillotine subdivisions approximate polygonal subdivisions: II—A simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problems. SIAM J. Comput. (1999) 24:1298–1309Crossref, Google Scholar
• Mosteller F.Fifty Challenging Problems in Probability with Solutions (1963) (Addison-Wesley, New York) Google Scholar
• Schelling T. C.The Strategy of Conflict (1960) (Oxford University Press, Oxford) Google Scholar
• Thomas L. C., Hulme P. B. Searching for targets who want to be found. J. Oper. Res. Soc. (1997) 48:44–50Crossref, Google Scholar
• Troutman J. L.Variational Calculus with Elementary Convexity (1983) (Springer-Verlag, New York) Crossref, Google Scholar