Cost-radius balanced spanning/Steiner trees
暂无分享,去创建一个
[1] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[2] David R. Karger,et al. Prim-Dijkstra tradeoffs for improved performance-driven routing tree design , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[3] Jason Cong,et al. Performance-Driven Interconnect Design Based on Distributed RC Delay Model , 1993, 30th ACM/IEEE Design Automation Conference.
[4] Chak-Kuen Wong,et al. New algorithms for the rectilinear Steiner tree problem , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[5] Samir Khuller,et al. Balancing minimum spanning and shortest path trees , 1993, SODA '93.
[6] Massoud Pedram,et al. Constructing minimal spanning/Steiner trees with bounded path length , 1996, Proceedings ED&TC European Design and Test Conference.
[7] D. T. Lee,et al. Bounded diameter minimum spanning trees and related problems , 1989, SCG '89.
[8] Mark Horowitz,et al. Signal Delay in RC Tree Networks , 1983, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[9] Jason Cong,et al. Provably good performance-driven global routing , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[10] Samir Khuller,et al. Balancing Minimum Spanning and Shortest Path Trees , 1993, SODA.
[11] David S. Johnson,et al. The Rectilinear Steiner Problem is NP-Complete , 1977 .
[12] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .