| Summary: | 碩士 === 國立臺灣海洋大學 === 資訊工程學系 === 92 === A Steiner minimal tree for a set Z of vertices on X Architectures is a tree, which interconnects Z using horizontal, vertical and oblique segments of shortest possible total length. In this paper, Lou bases on the Areibi‘s concepts and Prim’s minimal spanning tree algorithm to obtain the heuristic Steiner tree with Steiner ratio of 1.25 on X Architectures. The space and time complexities are O(N2) and O(N2+p3N), respectively, where N and p are the numbers of free and terminal vertices, respectively, p<N.
Furthermore, we applies the artributes of two-terminal nets and concept of reordering in the single-layer two-terminal nets routing algorithm to obtain a heuristic solution with reasonable sum of lengths of nets. The space and time complexities are O(N) and O(pN), respectively.
|
|---|
