Obstacle-Avoiding Heuristics for Steiner Tree Problem in EDA

masonchung

試誤型史坦那樹演算法及電子設計自動化應用
- F' w  q* j9 U2 B; a# d; `
" R( `- g% k0 N) L' lOutline

) t' c- @9 C* ?6 f3 N% B
Introduction Steiner Tree Problem & X Architecture
' I& J# d; I* mHigher Geometry Maze Routers Algorithm (HGMR Algorithm)
( h) n0 Q5 r/ r0 hLou’s Steiner Tree Algorithm
Lin’s Steiner Trees(ST) without Obstacles Algorithm
/ s/ F4 [  H2 ~* Q3 n/ I4 P% FLin’s Steiner Trees exist Local refinement without Obstacles Algorithm
Lin’s Steiner Trees with Obstacles Algorithm
Lin’s Steiner Trees exist Local refinement with Obstacles Algorithm
2 T/ e* u6 v/ O3 c$ h, o* e+ EThe Proposed Algorithm Example Compare
The Proposed Algorithm Compare Table
8 d9 }0 g3 C- vConclusions
* m0 d  X+ {$ R* ^0 P+ DFuture Studies

0 V2 i; A- T6 x: h! c" Z. Z+ zhttp://www.ntpu.edu.tw/csie/jan/ ... blem%20in%20EDA.ppt