The 1-Steiner tree problem in lambda-3 geometry plane

被引：0
|
作者：
Lin, GH [1 ]
Thurber, AP [1 ]
Xue, GL [1 ]
机构：
[1] Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA
来源：
ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS | 1999年
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we extend the 1-Steiner idea of Georgakopoulos and Papadimitriou [5] to the Steiner tree problem in lambda-3 geometry plane. Our extension to the lambda-3 geometry plane and that of Kahng and Robins [9] to the rectilinear plane are similar in principle, but different in many nontrivial details. After presenting an efficient algorithm for solving the 1-Steiner tree problem, we apply the iterated 1-Steiner heuristic to compute approximations to the Steiner minimum tree problem in lambda-3 geometry plane. Computational results on standard benchmarks show that our algorithm compares favorably with previously published heuristics.
引用
收藏
页码：125 / 128
页数：4
相关论文
共 50 条
12345