| 度约束最小生成树的快速算法 |
| |
| 引用本文： | 马良 蒋馥. 度约束最小生成树的快速算法[J]. 运筹与管理, 1998, 7(1): 1-5 |
| |
| 作者姓名： | 马良 蒋馥 |
| |
| 作者单位： | 上海交通大学系统工程研究所 |
| |
| 摘 要： | 本文对带有顶点度约束的最小生成树问题，给出了一种快速近似算法，并在微机上予以实现，经大量试算，效果良好。
|
| 关 键 词： | 度约束；生成树；算法 |
FAST ALGORITHM FOR THE DEGREE CONSTRAINED MINIMUM SPANNING TREE |
| |
| Ma Liang Jiang Fu. FAST ALGORITHM FOR THE DEGREE CONSTRAINED MINIMUM SPANNING TREE[J]. Operations Research and Management Science, 1998, 7(1): 1-5 |
| |
| Authors: | Ma Liang Jiang Fu |
| |
| Abstract: | This paper offers a fast approximation algorithm for the degree-constrained minimum spanning tree problem.The algorithm is implemented on microcomputer and the results are encouraging after many numerical tests |
| |
| Keywords: | degree-constrained spanning tree algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
