The polygonal contraction heuristic for rectilinear Steiner tree construction

Authors:
Yin Wang;Xianlong Hong;Tong Jing;Yang Yang;Xiaodong Hu;Guiying Yan
Affiliations:
Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Chinese Academy of Sciences, Beijing, P. R. China;Chinese Academy of Sciences, Beijing, P. R. China
Venue:
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Year:
2005

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
Efficient minimum spanning tree construction without Delaunay triangulation

Information Processing Letters
Efficient Steiner tree construction based on spanning graphs

Proceedings of the 2003 international symposium on Physical design
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An efficient hierarchical timing-driven Steiner tree algorithm for global routing

Integration, the VLSI Journal
Efficient octilinear Steiner tree construction based on spanning graphs

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Highly scalable algorithms for rectilinear and octilinear Steiner trees

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.