Title: New algorithm for solving degree constrained minimum spanning tree problem
Abstract:Regarding the characteristics of degree-constrained minimum spanning tree problem in network design and combi-natorial optimization,a new algorithm for the the k-degree minimum spanning tree on a desi...Regarding the characteristics of degree-constrained minimum spanning tree problem in network design and combi-natorial optimization,a new algorithm for the the k-degree minimum spanning tree on a designated point is presented on the base of the k minimum spanning tree’s algorithm.This new algorithm is supposed to change the minimum spanning tree in the optimal and operable way,and gradually make the degree of the designated point to be closer to the i-degree minimum spanning tree and finally reach the k-degree minimum spanning tree in network G.The correctness of this algorithm is proved by the given specific steps.Finallyt,he simulation and a practical transportation example turn out that the new algo-rithm is effective in the degree constrained minimum spanning tree problem.Read More
Publication Year: 2010
Publication Date: 2010-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot