最优控制树问题是大型通讯、交通和供销网络中的一类突出问题。以最小支撑树问题的贪婪算法为基础，分析了最优控制树的本质特征，得到了求网络中最优控制树的一种启发式算法，并给出了算例。%The optimal dominating tree question is a kind of prominent question in the large communication, transportation and supply-demand nets.Based the greed algorithm for smallest spanning tree,analyzed the essential characters of optimal dominating tree,obtained an elicitation method to solve optimal dominating tree in a net.An example was offered.
展开▼
