An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction.

Chih-Hung Liu Shih-Yi Yuan Sy-Yen Kuo Yao-Hsin Chou

Published in: DAC (2009)

Keyphrases

tree construction
worst case
cost function
learning algorithm
computational complexity
dynamic programming
detection algorithm
preprocessing
np hard
objective function
probabilistic model
data sets
mobile robot
particle swarm optimization