A heuristic method for constructing hexagonal Steiner minimal trees for routing in VLSI.
Tuhina SamantaPrasun GhosalHafizur RahamanParthasarathi DasguptaPublished in: ISCAS (2006)
Keyphrases
- high precision
- experimental evaluation
- computational cost
- dynamic programming
- neural network
- tree structure
- synthetic data
- detection method
- preprocessing
- objective function
- cost function
- pairwise
- high accuracy
- image processing
- data sets
- minimum spanning tree
- edge detection
- support vector machine svm
- segmentation method
- genetic algorithm