A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction.
Genggeng LiuWenzhong GuoYuzhen NiuGuolong ChenXing HuangPublished in: Soft Comput. (2015)
Keyphrases
- computational complexity
- dynamic programming
- worst case
- particle swarm optimization
- optimization algorithm
- minimum spanning tree
- segmentation algorithm
- cost function
- search space
- probabilistic model
- objective function
- tree structure
- linear program
- greedy algorithm
- convergence rate
- knapsack problem
- communication networks
- steiner tree