Obstacle-Avoiding Heuristics for Steiner Tree Problem in EDA

masonchung

試誤型史坦那樹演算法及電子設計自動化應用
6 r; v# f/ m, U& o. k
Outline

$ r; Y# W7 _, l' T6 c" @* S
) f4 D, O: e" z2 K3 }# AIntroduction Steiner Tree Problem & X Architecture
# `1 R+ t; s9 {7 k5 K8 P4 M$ `6 |" wHigher Geometry Maze Routers Algorithm (HGMR Algorithm)
Lou’s Steiner Tree Algorithm
" Y6 w, `$ [3 nLin’s Steiner Trees(ST) without Obstacles Algorithm
8 T" n6 H- L% m. C( @6 w* K- vLin’s Steiner Trees exist Local refinement without Obstacles Algorithm
4 ]. u; u7 U1 LLin’s Steiner Trees with Obstacles Algorithm
Lin’s Steiner Trees exist Local refinement with Obstacles Algorithm
: x! A4 J: O7 E4 I* V, QThe Proposed Algorithm Example Compare
The Proposed Algorithm Compare Table
* w6 b* x" ?  X4 `8 k) o, [Conclusions
3 w$ n: w$ c9 N) W+ d; K! GFuture Studies
- g! ~: S8 A2 j$ x- c
6 ?: b, t! }  V4 D. O1 I, q4 ^http://www.ntpu.edu.tw/csie/jan/ ... blem%20in%20EDA.ppt