1. On-line Steiner trees in the Euclidean plane;Alon;Proc. 8th Symp. on Computational Geometry,1992
2. Y. Azar, Lower bounds for insertion methods for TSP, manuscript.
3. R. Baeza-Yates, J. Culberson and G. Rawlins, Searching with uncertainty, Inform. and Comput., to appear.
4. Experiments on traveling salesman heuristics;Bentley;Proc. 1st ACM/SIAM Conf. on Discrete Algorithms,1990
5. An analysis of two heuristics for the Euclidean traveling salesman problem;Bentley;Proc. 18th Annu. Allerton Conf. on Communication, Control, and Computing,1980