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={J. Ho and G. Vijayan and C. Wong},
  journal={1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers},
  year={1989},
  pages={6-9}
}
  • J. Ho, G. Vijayan, C. Wong
  • Published 1989
  • Mathematics, Computer Science
  • 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers
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>> 
15 Citations
A neighborhood improvement algorithm for rectilinear Steiner trees
  • N. Hasan, G. Vijayan, C.K. Wong
  • Mathematics
  • IEEE International Symposium on Circuits and Systems
  • 1990
  • 34
Switchbox Steiner tree problem in presence of obstacles
  • 8
NonHanan Routing
  • 1
  • PDF
Routing tree topology construction to meet interconnect timing constraints
  • 8
  • PDF
Non-Hanan routing
  • 42
  • PDF
Steiner tree problems
  • 472
A global router with a theoretical bound on the optimal solution
  • IV RobertC.Carden, Jianmin Li, C. Cheng
  • Mathematics, Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1996
  • 66
A global router using an efficient approximate multicommodity multiterminal flow algorithm
  • 67
  • PDF
A a Theoretical al Solutio
Area routing for analog layout
  • 50
...
1
2
...

References

SHOWING 1-10 OF 10 REFERENCES
The Rectilinear Steiner Tree Problem in NP Complete
  • 1,027
A New Approach to the Rectilinear Steiner Tree Problem
  • 46
  • PDF
Rectilinear steiner trees: Efficient special-case algorithms
  • 103
A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle
  • 12
Use of steiner's problem in suboptimal routing in rectilinear metric
  • 89
On Steiner Minimal Trees with Rectilinear Distance
  • 427
Algorithms for Global Routing
  • 8
A new global router for row-based layout
  • Kai-Win Lee, C. Sechen
  • Engineering, Computer Science
  • [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers
  • 1988
  • 89
  • PDF
On Steiner’s Problem with Rectilinear Distance
  • 624
  • PDF