An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing.
Jingyu XuXianlong HongTong JingYici CaiJun GuPublished in: VLSI Design (2002)
Keyphrases
- optimal solution
- computational complexity
- linear programming
- steiner tree
- routing problem
- dynamic programming
- cost function
- simulated annealing
- particle swarm optimization
- segmentation algorithm
- shortest path
- ant colony optimization
- segmentation method
- mathematical model
- search space
- objective function
- special case
- worst case
- neural network
- lower and upper bounds
- minimum spanning tree