区间树是在平衡树基础上进行扩展得到的支持以区间为元素的动态集合的操作，其中每个节点的关键值是区间的左端点。
找出“模式”的区间树的节点代表。
Figure out "the pattern" of the intervals the tree nodes represent.
该算法利用改进的二叉区间树有效组织中间数据，降低计算的复杂度。
Besides, an enhanced interval tree is used to manage and organize the intermediate data so as to reduce the computation complexity.
考虑了在带区间数据的不确定网络中，最小风险和模型以及最小最大风险模型下的斯坦纳树问题。
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.
应用推荐