Hybrid Evolutionary Algorithms for the Rectilinear Steiner Tree Problem Using Fitness Estimation

2006 ◽  
pp. 581-589
Author(s):  
Byounghak Yang
Keyword(s):  
Evolutionary Algorithms ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Rectilinear Steiner Tree ◽  
Hybrid Evolutionary Algorithms

scholarly journals Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem

1997 ◽  
Vol 18 (1) ◽  
pp. 93-109 ◽  
Author(s):  
U. Fößmeier ◽  
M. Kaufmann ◽  
A. Zelikovsky
Keyword(s):  
Approximation Algorithms ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Rectilinear Steiner Tree

Rectilinear Steiner Tree Construction Techniques Using PB-SAT-Based Methodology

2019 ◽  
Vol 29 (04) ◽  
pp. 2050057
Author(s):  
Sudeshna Kundu ◽  
Suchismita Roy ◽  
Shyamapada Mukherjee
Keyword(s):  
Steiner Tree ◽  
Large Scale ◽  
Fundamental Problem ◽  
Physical Design ◽  
Steiner Tree Problem ◽  
Wire Length ◽  
Vlsi Physical Design ◽  
Rectilinear Steiner Tree ◽  
Large Scale Integration ◽  
Scale Integration

Rectilinear Steiner Tree (RST) construction is a fundamental problem in very large scale integration (VLSI) physical design. Its applications include placement and routing in VLSI physical design automation (PDA) where wire length and timing estimations for signal nets are obtained. In this paper, a pseudo-Boolean satisfiability (PB-SAT)-based approach is presented to solve rectilinear Steiner tree problem. But large nets are a bottleneck for any SAT-based approach. Hence, to deal with large nets, a region-partitioning-based algorithm is taken into consideration, which eventually achieves a reasonable running time. Furthermore, a clustering-based approach is also explored to improve the partitioning of nets by identifying clusters and then applying a heuristic-based approach to get the minimum wire length for each set of the clusters. Experimental results obtained by these techniques show that the proposed algorithm can solve the RST problem very effectively even on large circuits and it outperforms the widely used RST algorithm FLUTE with 3[Formula: see text][Formula: see text][Formula: see text]to 9[Formula: see text][Formula: see text][Formula: see text]speedups.

Sign in / Sign up

Export Citation Format

Share Document