1) generalized Steiner problem
广义Steiner问题
2) generalized Euclidean Steiner problem
广义欧几里德Steiner问题
3) Steiner problem
Steiner问题
1.
The generalized Euclidean Steiner problem is to find the shortest network satisfying specified connectivity requirements, which connects a set of given points in the Euclidean plane.
广义欧几里德Steiner问题是指确定连接平面上一组给定点的满足特定连通性要求的最短网络的问题。
4) Steiner Tree Problem
Steiner树问题
1.
In allusion to the traditional location model based on the algorithm encapsulated by GIS software,a location model of Steiner tree problem is proposed and its heuristic algorithm based on multi-agent system is given.
针对建立在GIS软件封装好的算法中的传统选址模型,提出Steiner树问题的选址模型,给出了该模型基于多Agent系统的启发式算法。
5) group Steiner problem
分组Steiner问题
1.
We review different avenues to solve two closely-related NP-hard problems in theoretical computer science,the group Steiner problem and the covering Steiner problem,and design improved approximation algorithm for some special cases of them.
综合论述了理论计算机科学领域中两个密切相关的NP-困难问题:分组Steiner问题和覆盖Steiner问题的不同解决途径,并就其若干特殊情形设计了近似比更好的近似算法。
6) covering Steiner problem
覆盖Steiner问题
1.
Algorithms for some cases of group and covering Steiner problems;
若干情形分组和覆盖Steiner问题的算法
补充资料：广义特征值问题数值解法
见代数特征值问题数值解法。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条