Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles
暂无分享,去创建一个
[1] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..
[2] G. Vijayan,et al. A neighborhood improvement algorithm for rectilinear Steiner trees , 1990, IEEE International Symposium on Circuits and Systems.
[3] Dana S. Richards,et al. Optimal two-terminal α-β wire routing , 1986, Integr..
[4] Dave Hightower. A solution to line-routing problems on the continuous plane , 1969, DAC '69.
[5] C. Y. Lee. An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..
[6] J. Beasley. A heuristic for Euclidean and rectilinear Steiner problems , 1992 .
[7] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .
[8] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[9] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.