A Greedy Algorithm to solve md-MST Problem Based on Edgeexchange
Le Zhao · Shuxue de shijian yu renshi · 2015
Analyzing the md-MST problem,a greedy algorithm is put forward.The algorithm uses the greedy algorithm to generate a spanning tree ST,adjusts the spanning tree ST by edge exchange and gets a feasible solution to meet the problem constraints,then optimizes the spanning tree ST by further edge exchange and gets optimal solution or close to the optimal approximate solution.Experiments show that,this algorithm can calculate the mass random graph of md-MST vertices in a short period of time,it is a very practical and accurate algorithm for solving md-MST problems.