Sciweavers

64 search results - page 2 / 13
» Probability-based approach to rectilinear Steiner tree probl...
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
13 years 10 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
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
14 years 1 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
VLSID
2002
IEEE
109views VLSI» more  VLSID 2002»
14 years 6 months ago
Probabilistic Analysis of Rectilinear Steiner Trees
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...
Chunhong Chen
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 7 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
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
13 years 10 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...