Obstacle-Avoiding Heuristics for Steiner Tree Problem in EDA

masonchung

試誤型史坦那樹演算法及電子設計自動化應用
, }' `$ D) P% e8 q2 S: s
- e* }& k0 `* sOutline


* s$ y; d$ H! W6 f2 @Introduction Steiner Tree Problem & X Architecture
/ I& [  J8 M$ X7 n) |" XHigher Geometry Maze Routers Algorithm (HGMR Algorithm)
+ N7 l- J5 {7 p. ~& r4 FLou’s Steiner Tree Algorithm
  U$ y0 K$ Q+ [: ZLin’s Steiner Trees(ST) without Obstacles Algorithm
4 C# U- g3 H1 o. `) a# V) fLin’s Steiner Trees exist Local refinement without Obstacles Algorithm
9 M2 ?( ?+ D5 I7 jLin’s Steiner Trees with Obstacles Algorithm
Lin’s Steiner Trees exist Local refinement with Obstacles Algorithm
: S; `- y& w9 u2 BThe Proposed Algorithm Example Compare
The Proposed Algorithm Compare Table
Conclusions
Future Studies

http://www.ntpu.edu.tw/csie/jan/ ... blem%20in%20EDA.ppt