Obstacle-Avoiding Heuristics for Steiner Tree Problem in EDA

masonchung

試誤型史坦那樹演算法及電子設計自動化應用
  {$ l: J, A8 C2 ~$ Z2 p
Outline
0 P8 }0 `2 \# w5 a* J

6 ]1 {( p6 {: p' C6 g) _" I2 VIntroduction Steiner Tree Problem & X Architecture
Higher Geometry Maze Routers Algorithm (HGMR Algorithm)
Lou’s Steiner Tree Algorithm
Lin’s Steiner Trees(ST) without Obstacles Algorithm
Lin’s Steiner Trees exist Local refinement without Obstacles Algorithm
" }" m# ~# I- l6 Q  l; w7 b& j3 D. [Lin’s Steiner Trees with Obstacles Algorithm
8 E& D$ J8 w. D5 c! z3 GLin’s Steiner Trees exist Local refinement with Obstacles Algorithm
The Proposed Algorithm Example Compare
* u! q/ s2 M* O7 K2 x! o; x% QThe Proposed Algorithm Compare Table
Conclusions
Future Studies
6 ^4 _8 X- C* y! o
http://www.ntpu.edu.tw/csie/jan/ ... blem%20in%20EDA.ppt