A heuristic global router for polycell layout
暂无分享,去创建一个
V. K. De | K. Kozminski | G. Kedem | G. Kedem | K. Kozminski | V. K. De
[1] R. Prim. Shortest connection networks and some generalizations , 1957 .
[2] M. Hanan. A Counterexample to a Theorem of Fu on Steiner's Problem , 1972 .
[3] Ben Ting,et al. Routing Techniques for Gate Array , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[4] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .
[5] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[6] C. Y. Lee. An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..
[7] David S. Johnson,et al. The Rectilinear Steiner Problem is NP-Complete , 1977 .
[8] E. N. Gilbert. Random Minimal Trees , 1965 .
[9] A. Sangiovanni-Vincentelli,et al. The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.