1) least rectangle steiner tree
最小矩形斯坦纳树
2) Steiner routing tree
最小斯坦那树
1.
This paper introduces a non-hanan timing-driven Steiner routing tree generation algorithm for single net,which allows Steiner point to be on non-hanan grid thus to reduce the single-net tree length under delay constraint.
介绍了一个基于非hanan点的时延约束最小斯坦那树生成方法,该方法引入非hanan点的概念,可以得到长度费用优化较好的布线树。
3) 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.
本文主要研究了斯坦纳树问题和连通控制集问题及它们变形的近似算法。
4) Group Steiner tree
组斯坦纳树
5) Prize-collecting Steiner tree problem
奖励收集斯坦利最小树
6) Steiner tree of a graph
图的斯坦纳树
补充资料：纳坦
1.复姓。金代有纳坦谋嘉。见《金史》本传。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条