Obstacle-Avoiding Heuristics for Steiner Tree Problem in EDA

masonchung

試誤型史坦那樹演算法及電子設計自動化應用
; V3 Z, H7 N9 N
+ Q/ U- |% a2 g5 pOutline
5 H8 C; D# @" p6 M
( R1 d% Y: Z# `# H! {
7 X: U! y7 `. @( N1 tIntroduction Steiner Tree Problem & X Architecture
Higher Geometry Maze Routers Algorithm (HGMR Algorithm)
+ s! w! Q. C+ bLou’s Steiner Tree Algorithm
Lin’s Steiner Trees(ST) without Obstacles Algorithm
Lin’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
The Proposed Algorithm Example Compare
The Proposed Algorithm Compare Table
9 k" h+ Q8 J) P- kConclusions
Future Studies

5 q; W- z% a: }1 O9 q% [http://www.ntpu.edu.tw/csie/jan/ ... blem%20in%20EDA.ppt