Sciweavers

Share
26 search results - page 1 / 6
» A new heuristic for rectilinear Steiner trees
Sort
View
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
9 years 3 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
TCAD
2002
128views more  TCAD 2002»
8 years 11 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
9 years 5 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
ASPDAC
2005
ACM
158views Hardware» more  ASPDAC 2005»
9 years 1 months ago
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 (...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
9 years 3 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
books