30 search results - page 2 / 6 » Efficient obstacle-avoiding rectilinear steiner tree constru... |
86
Voted
ISPD
2007
ACM
14 years 11 months ago
2007
ACM
139
click to vote
ICCAD
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
TCAD
2008
14 years 9 months ago
2008
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...