Efficient octilinear Steiner tree construction based on spanning graphs

--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both based on octilinear spanning graphs. The one by edge substitution (OST-E) has a worst case running time of O(nlogn) and similar performance as the batched greedy algorithm[9]. The other one by triangle contraction (OST-T) has a small increase in running time and better performance. Experiments on both industry and random test cases are conducted.

• Type: Conference
• Year: 2004
• Where: ASPDAC
• Authors: Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Yang
• Keywords: ASPDAC 2004, Case Running Time, Heuristic Octilinear Steiner, Octilinear Spanning Graphs