265 search results - page 18 / 53 » Algorithms for Terminal Steiner Trees |
128
click to vote
ASPDAC
2005
ACM
15 years 5 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 (...
130
click to vote
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
137
click to vote
DAM
1999
15 years 3 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
128
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monoton...
