The Polygonal Contraction Heuristic For Rectilinear Steiner Tree Construction

Yin Wang,Xianlong Hong,Tong Jing, Yang Yang,Xiaodong Hu,Guiying Yan

ASPDAC（2005）

引用 2|浏览7

暂无评分

摘要

Motivated by VLSI/ULSl 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.

查看译文

关键词

ULSI,VLSI,integrated circuit design,network routing,trees (mathematics),ULSI routing application,VLSI routing application,polygonal contraction,rectilinear Steiner minimal tree construction,rectilinear Steiner tree construction,rectilinear minimum spanning tree,

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要