沈阳大学学报2012，Vol.24Issue(4)：63-65,73,4.
度、半径约束最小生成树问题及其算法
Degree-Constrained, Radius-Constrained Minimum Spanning Tree Problem and its Algorithm
摘要
Abstract
The degree-constrained, radius-constrained minimum spanning tree problem was put forward, and it was proved to be NP-complete. A mathematics programming model of the problem and a fast heuristic algorithm were proposed to solve the model. The time complexity of the algorithm was analyzed. The algorithm was proved to be effective by analysis and experiments.关键词
最小生成树问题/启发式算法/度约束/半径约束Key words
minimum spanning tree problem/heuristic algorithm/degree-constrainedradius-constrained分类
计算机与自动化引用本文复制引用
石磊,冯祖针,杨建强,龙瑶..度、半径约束最小生成树问题及其算法[J].沈阳大学学报,2012,24(4):63-65,73,4.基金项目
云南省自然科学基金资助项目 （）
