Edward J. Anderson
- 1.S, Alpem. The rendezvous search problem. SIAM Journal on Control and Optimization, 33 (1995), 673--683. Google Scholar
Digital Library
- 2.S, Alpem and A. Beck. Rendezvous search on the line with bounded resources: minimizing expected meeting time, European Journal o} Operational Research, to appear, Google ScholarDigital Library
- 3.S, Alpern and A. Beck. Rendezvous search on the line with bounded resources: maximizing the probability of meeting, LSE Mathematics Preprlnt series (1997).Google Scholar
- 4.S, Alpem and A. Beck. Rendezvous search on the line is a double linear search problem. Preprint (1997).Google Scholar
- 5.S, Alpem and S, Gal. Rendezvous search on the line with distinguishable players. SIAM Y. Control and Optimization, 33 (1995), 1270--1276. Google ScholarDigital Library
- 6.S, Alpern and J.V.Howard. Alternating search at two locations. Preprint.Google Scholar
- 7.S, Alpem and W, S. Lira. The symmetric rendezvousevasion game, SIAM Journal of Control and Optimization, to appear. Google ScholarDigital Library
- 8.E, J. Anderson and S. Essegaier. Rendezvous search on tim line with indistinguishable players. SIAM J. Control and Optimization, 33 (1995), 1637-1642. Google ScholarDigital Library
- 9.E. J, Anderson and R.R. Weber. The rendezvous problem on discrete locations. J. Applied Probability, 28 (1990), 839-851.Google Scholar
- 10.E, M. Arldn, S, P. Fekete, and J. S. B. Mitchell. The lawnmower problem. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo 1993, ,161-466.Google Scholar
- 11.E, M, Arkin, S. P. Fekete, and J. S. B. Mitchell. Approximation algorithms for lawn mowing and milling. ZPR Report 9%255, available at ftp://ftp.zpr.unikooln, do/pub/paper/zpr97-255 .ps.gz, 1997.Google Scholar
- 12.S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proceedings o} the 37th Annual IEEE Symposium on the Foundations of Computer Science, 1996, 2-12. Google ScholarDigital Library
- 13.R. A. Baeza-Yates, I. C. Culberson, and G. J. E. Rawlins. Searching in the plane. Information and Gompu. tation, 106 (1993), 234-252. Google ScholarDigital Library
- 14.V.J.Baston. Two rendezvous search problems on the line. Preprint. 1997.Google Scholar
- 15.V.J. Baston and S. Gal. Minmax rendezvous on the line, Preprint. 1997.Google Scholar
- 16.A.Beck and D.l.Newman. Yet more on the linear search problem. Israel J. Math., 8 (1970), 419-429.Google ScholarCross Ref
- 17.A. Blum, P. Chalasani, D. Coppersmith, W. R. Pulleyblank, P. Raghavan, and M. Sudan, The minimum latency problem. Proc. Ann. Syrup. Theo. Comp. (STOC), 1994, 16.3-171. Google ScholarDigital Library
- 18.S. Gal. Continuous search games. Chapter 3 in: D. V. Ghudnovsky, G. V. Chudnovsky, eds., Search theory. Marcel Dekker Lecture notes in pure and applied mathematics, v. 112, New York 1939.Google Scholar
- 19.S. Gal. Rendezvous search on the line. Preprint. 1996.Google Scholar
- 20.B. Gluss. The minmax path in the search for a circle in the plane. Naval Res. Logist. Quart., 8 (1961), 357-360.Google ScholarCross Ref
- 21.M.X. Goemaus and J.Kleinberg. An improved approximation ratio for the minimum latency problem. Proc. 7th A GM-SIAM Syrup. Disc. AIg.(SODA), 1996. Google ScholarDigital Library
- 22.T. Healey. Journeys (sometimes) end in lovers meeting. Annals of improbable Research, 3 (3), 1997, 26-27.Google Scholar
- 23.3.V.Howard. Rendezvous search on the interval and the circle. Technical Report 96-12, London School of Economics, 1996.Google Scholar
- 24.W.S. Lira and S. Alpem. Minimax rendezvous search on the llne. SIAM J. Control and Opt., 34 1996, 1650-- 1665.Google ScholarCross Ref
- 25.W.S. Lira and S. Alpem. Minimax triple rendezvous on the line: corrections and extensions. LSE Mathematics Preprint Series (1997).Google Scholar
- 26.W. S. Lira., S. Alpem, and A. Beck. Rendezvous search on the llne with more than two players. Operations Re. search, 45 1997, 357-364.Google ScholarDigital Library
- 27.J.S.B.Mitchdl. Guillotine subdivisions approximate polygonal subdivisions: Part II - A simple polynomialtime approximation scheme for geometric k-MST, TSP, and related problems. To appear, SIAM Journal o.f Computing. Available at http:Hams.sunysb.edu/ -jsbm/jsbm.html. Google ScholarDigital Library
- 28.F. Mosteller. Fifty Challenging Problems in Probability with Solutions. Addison-Wesley, New York, 1963.Google Scholar
- 29.T.C.Schelling. The Strategy of Conflict. Oxford University Press, Oxford, 1960.Google Scholar
- 30.J.L.Troutman. Variational Calculus with Elementary Convexity. Springer-Verlag, New York, 1983.Google ScholarCross Ref
Index Terms
- Asymmetric rendezvous on the plane
Recommendations
Common transversals in the plane: The fractional perspective
A fresh look is taken at the fractional Helly theorem for line transversals to families of convex sets in the plane. This theorem was first proved in 1980 by Katchalski and Liu [M. Katchalski, A. Liu, Symmetric twins and common transversals, Pacific J. ...
Facets of the Asymmetric Traveling Salesman Polytope
In this paper we consider the Asymmetric Traveling Salesman polytope, Pn, defined as the convex hull of the incidence vectors of tours in a complete digraph with n vertices, and its monotonization, P̃n. Several classes of valid inequalities for both ...
The Graphical Asymmetric Traveling Salesman Polyhedron: SymmetricInequalities
A present trend in the study of the symmetric traveling salesman polytope is to use, as a relaxation of the polytope, the graphical traveling salesman polyhedron ($\g$). Following a parallel approach for the asymmetric traveling salesman polytope, we ...
Comments