22 search results - page 3 / 5 » Obstacle-avoiding rectilinear Steiner tree construction |
117
Voted
DAC
1994
ACM
15 years 3 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
97
Voted
ISPD
2007
ACM
15 years 1 months ago
2007
ACM
TCAD
2002
14 years 11 months ago
2002
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
122
Voted
WADS
2007
Springer
15 years 5 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
107
click to vote
DAC
1989
ACM
15 years 3 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...