1) rectilinear Steiner tree
直角斯坦纳树
1.
At first, this thesis introduces the VLSI physical design process, based on this leads to the rectilinear Steiner tree problem.
本文首先介绍了超大规模集成电路的物理设计流程,在此基础上引出直角斯坦纳树问题。
2) Steiner tree
斯坦纳树
1.
Steiner tree is applied to implement the global routing, of course it is also used to do the detail routing when considering the obstructs between units.
斯坦纳树（ＳｔｅｉｎｅｒＴｒｅｅ）的构造问题可以应用于总体布线；如果考虑已有单元或连线的障碍，它也可以应用于详细布线。
2.
In this thesis,we mainly study the approximation algorithms on Steiner tree problem and connected dominating set problem and their variants.
本文主要研究了斯坦纳树问题和连通控制集问题及它们变形的近似算法。
3) Group Steiner tree
组斯坦纳树
4) Steiner tree of a graph
图的斯坦纳树
5) Steiner tree problems
斯坦纳树问题
1.
Based on the models of minimum risk sum and minimum maximum risk, this paper is concerned with the minimum Steiner tree problems in uncertain networks with interval data.
考虑了在带区间数据的不确定网络中,最小风险和模型以及最小最大风险模型下的斯坦纳树问题。
6) minimun rectitinear Steiner tree
最小化直角折线斯戴纳树
补充资料：直角
见“角④”(1205页)。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条