Toward a Steiner Engine: Enhanced Serial and Parallel Implementations of the Iterated 1-Steiner MRST Heuristic

[1]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[2]  J. S. Lee,et al.  Use of steiner's problem in suboptimal routing in rectilinear metric , 1976 .

[3]  Christos H. Papadimitriou,et al.  The 1-Steiner Tree Problem , 1987, J. Algorithms.

[4]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[5]  Timothy Law Snyder,et al.  On the Exact Location of Steiner Points in General Dimension , 1992, SIAM J. Comput..

[6]  David S. Johnson,et al.  The Rectilinear Steiner Problem is NP-Complete , 1977 .

[7]  Chak-Kuen Wong,et al.  New algorithms for the rectilinear Steiner tree problem , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[9]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[10]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[12]  G. Vijayan,et al.  A neighborhood improvement algorithm for rectilinear Steiner trees , 1990, IEEE International Symposium on Circuits and Systems.

[13]  Gabriel Robins.  On optimal interconnections , 1992 .

[14]  Jack Dongarra,et al.  A User''s Guide to PVM Parallel Virtual Machine , 1991 .

[15]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[16]  Vaidy S. Sunderam,et al.  PVM: A Framework for Parallel Distributed Computing , 1990, Concurr. Pract. Exp..

[17]  Carl Sechen,et al.  A new global router for row-based layout , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[18]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .