AN OPTIMAL ALGORITHM FOR RECTILINEAR STEINER TREES FOR CHANNELS WITH OBSTACLES

被引:4
|
作者
CHIANG, C [1 ]
SARRAFZADEH, M [1 ]
WONG, CK [1 ]
机构
[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
关键词
D O I
10.1002/cta.4490190604
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The channel rectilinear Steiner tree problem is to construct an optimal rectilinear Steiner tree interconnecting n terminals on the upper shore and the lower shore of a channel without crossing any obstacles inside the channel. However, intersecting boundaries of obstacles is allowed. We present an algorithm that computes an optimal channel rectilinear Steiner tree in O(F1(k)n + F2(k)) time, where k is the number of obstacles inside the channel and F1 and F2 are exponential functions of k. For any constant k the proposed algorithm runs in O(n) time.
引用
收藏
页码:551 / 563
页数:13
相关论文
共 50 条