Sciweavers

73 search results - page 6 / 15
» The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner ...
Sort
View
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 6 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
15 years 4 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak
MFCS
2001
Springer
15 years 2 months ago
On the Approximability of the Steiner Tree Problem
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
Martin Thimm
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
15 years 1 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...
GLVLSI
1995
IEEE
96views VLSI» more  GLVLSI 1995»
15 years 1 months ago
Thumbnail rectilinear Steiner trees
Joseph L. Ganley, James P. Cohoon