The polygonal contraction heuristic for rectilinear Steiner tree construction

— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (RMST) into an RSMT by a novel method called polygonal contraction. Experimental results show that the heuristic matches or exceeds the solution quality of previously best known algorithms and runs much faster.

• Type: Conference
• Year: 2005
• Where: ASPDAC
• Authors: Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xiaodong Hu, Guiying Yan
• Keywords: ASPDAC 2005, Hardware, Minimum Spanning Tree, Steiner Minimal Tree, VLSI/ULSI Routing Applications