O(N LOG N) ALGORITHM FOR SUBOPTIMAL RECTILINEAR STEINER TREES

被引:36
作者
HWANG, FK
机构
[1] Bell Laboratories, Murray Hill
来源
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS | 1979年 / 26卷 / 01期
关键词
D O I
10.1109/TCS.1979.1084551
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We propose a suboptimal rectilinear Steiner tree algorithm which can be constructed in 0(n log n) time, and has good average-case and worst case performance. © 1979 IEEE
引用
收藏
页码:75 / 77
页数:3
相关论文
共 12 条
[11]   SUBOPTIMAL ALGORITHM FOR A WIRE ROUTING PROBLEM [J].
YANG, YY ;
WING, O .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1972, CT19 (05) :508-&
[12]  
YANG YY, 1972, THESIS COLUMBIA U