Sciweavers

32 search results - page 5 / 7
» Thumbnail rectilinear Steiner trees
Sort
View
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
14 years 1 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...
ISPD
2007
ACM
82views Hardware» more  ISPD 2007»
13 years 11 months ago
Efficient obstacle-avoiding rectilinear steiner tree construction
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
14 years 1 months ago
A tree-based genetic algorithm for building rectilinear Steiner arborescences
A rectilinear Steiner arborescence (RSA) is a tree, whose nodes include a prescribed set of points, termed the vertices, in the first quadrant of the Cartesian plane, and whose tr...
William A. Greene
DAC
2006
ACM
14 years 10 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 3 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor