Sciweavers

73 search results - page 3 / 15
» The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner ...
Sort
View
JAL
1998
48views more  JAL 1998»
13 years 5 months ago
The k-Steiner Ratio in the Rectilinear Plane
Al Borchers, Ding-Zhu Du, Biao Gao, Peng-Jun Wan
TCAD
2002
128views more  TCAD 2002»
13 years 5 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»
13 years 11 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
ICCAD
2010
IEEE
229views Hardware» more  ICCAD 2010»
13 years 3 months ago
Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach
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...
Tao Huang, Evangeline F. Y. Young
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 6 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su