New algorithms for the rectilinear Steiner tree problem

  title={New algorithms for the rectilinear Steiner tree problem},
  author={Jan-Ming Ho and Gopalakrishnan Vijayan and Chak-Kuen Wong},
  journal={IEEE Trans. on CAD of Integrated Circuits and Systems},
We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in our approach is to find layouts for the edges of the MST, so as to maximize the overlaps between the layouts, thus minimizing,the cost (i.e., wire length) of the resulting rectilinear Steiner tree. We describe two algorithms for constructing rectilinear Steiner trees from MST’s, that are optimal under the conditions… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 115 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 62 extracted citations

116 Citations

Citations per Year
Semantic Scholar estimates that this publication has 116 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 11 references

B.Sc. degree in mathematics from the University of Madras, India, in 1975, the B.E. degree in electronics and communication engineering in 1978 and the M.E. degree in automation

  • Gopalakrishnan Vijayan
  • 1980

An O ( n log n ) algorithm for suboptimal rectilinear Steiner trees.

  • F. K. Hwang
  • IEEE Trans. Circuits Syst., vol
  • 1979

Use of Steiner’s problem in suboptimal routing in rectilinear metric,

  • J . H. Lee, N. K . Bose, F. K. Hwang
  • IEEE Trans. Circuits Syst., vol
  • 1976

Research Center in 1969 as a Research Staff Member and is currently manager of the VLSI Design Algorithms group in the Computer Sciences Department

  • T. J. Watson
  • 1969

Similar Papers

Loading similar papers…