Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree

@article{Ho1989ConstructingTO,
  title={Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree},
  author={Jan-Ming Ho and Gopalakrishnan Vijayan and Chak-Kuen Wong},
  journal={1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers},
  year={1989},
  pages={6-9}
}
A polynomial time algorithm is given for constructing the minimum cost rectilinear Steiner tree (RST) that is derivable from a minimum spanning tree (MST) of a given point set, such that the MST edges have staircase layouts in the RST. RSTs produced by the algorithm have a property called stability, which enables the rerouting of any subset of the RST edges, while maintaining the cost of the RST, and not causing overlaps with each other or with the other RST edges.<<ETX>> 

Citations

Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

Non-sequential tool interaction strategies for sea-of-gates layout synthesis

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Non-Hanan routing

Area routing for analog layout