1. T. Barrera, J. Griffith, S. A. McKee, G. Robins, and T. Zhang, Toward a Steiner Engine: Enhanced Serial and Parallel Implementations of the Iterated 1-Steiner Algorithm,Proc. Great Lakes Symp. VLSI, Kalamazoo, MI, March 1993, pp. 90–94.
2. T. Barrera, J. Griffith, G. Robins, and T. Zhang, Narrowing the Gap: Near-Optimal Steiner Trees in Polynomial Time,Proc. IEEE Internat. ASIC Conf. Rochester, NY, September 1993, pp. 87–90.
3. D. Cieslik, The Vertex Degree of Steiner Minimal Trees in Minkowski Planes, inTopics in Combinatorics and Graph Theory, R. Bodendieck and R. Henn (eds.), Physics-Verlag, Heidelberg, 1990, pp. 201–206.
4. T. H. Cormen, C. E. Leiserson and R. Rivest,Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
5. J. T. Croft, K. J. Falconer, and R. K. Guy,Unsolved Problems in Geometry, Springer-Verlag, New York, 1991.