An Optimal Steiner Tree Algorithm for a Net Whose Terminals Lie on the Perimeter of a Rectangle

James Cohoon, Dana Richards & J Salowe
Given a set of input points, the rectilinear Steiner tree problem is to find a minimal length tree consisting of vertical and horizontal line segments that Connects the input points, where it is possible to add new points to minimize the length of the tree. The restricted Steiner tree problem in which all the input points lie on the boundary of a rectangle frequently occurs in VLSI physical design. Since the fastest published algorithm is...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.