根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.
文中将机制设计的标准工具VGC机制应用到解决最小支撑树问题。
Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.
主要研究两类约束最小支撑树问题，即点约束和边约束最小支撑树问题。
In this paper, two types of the minimum weight spanning tree with constraints are investigated.
应用推荐