A Study on Minimum Steiner Tree Algorithms and the Application of Routing Algorithms to Near-Future Traffic Evaluation Based Automatic Navigation
博士 === 國立交通大學 === 資訊科學與工程研究所 === 106 === Routing has many applications in industry and life. In industry, routing is a main step in the design of integrated circuits (ICs). Multi-layer obstacle-avoiding rectilinear Steiner tree (ML-OARST) construction is crucial for a router or a placer to approxima...
Main Authors: | Lin, Kuen-Wey, 林昆蔚 |
---|---|
Other Authors: | Li, Yih-Lang |
Format: | Others |
Language: | en_US |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/ee82jd |
Similar Items
-
On the Near Minimum Cost Steiner Tree - A Heuristic Algorithm For Multicast Routing Decision
by: Hsu, Chih-Sheng, et al.
Published: (1997) -
Algorithms for the directed k-spanner with minimum degree steiner tree problem
by: Braga, Hugo Vinícius Vaz
Published: (2013) -
The Study of Minimum Steiner Tree
by: Huei-Ru You, et al.
Published: (2012) -
A Heuristic Algorithms for Clustered Steiner Minimum Tree Problem Based on MapReduce
by: Jian-Ning Wu, et al.
Published: (2016) -
An on-line algorithm for rectilinear steiner trees
by: 王學武
Published: (1992)