The polygonal contraction heuristic for rectilinear Steiner tree construction

13 years 1 months ago

Download www.ee.ucla.edu

— 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.

Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia

Real-time Traffic

ASPDAC 2005 | Hardware | Minimum Spanning Tree | Steiner Minimal Tree | VLSI/ULSI Routing Applications |

claim paper

» A Fast and Stable Algorithm for ObstacleAvoiding Rectilinear Steiner Minimal Tree Construc...

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» Multilayer ObstacleAvoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

» Obstacleavoiding rectilinear Steiner tree construction

» ObstacleAvoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

» Preferred direction Steiner trees

» FLUTE Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design

» CDCTree novel obstacleavoiding routing tree construction based on current driven circuit m...

Post Info
More Details (n/a)

Added	13 Oct 2010
Updated	13 Oct 2010
Type	Conference
Year	2005
Where	ASPDAC
Authors	Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xiaodong Hu, Guiying Yan

Comments (0)

Sciweavers

The polygonal contraction heuristic for rectilinear Steiner tree construction

ASPDAC 2005 | Hardware | Minimum Spanning Tree | Steiner Minimal Tree | VLSI/ULSI Routing Applications |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers