| 最小代价归并树的动态规划实现 |
| |
| 引用本文： | 李少芳,陈德礼.最小代价归并树的动态规划实现[J].太原师范学院学报(自然科学版),2007,6(3):120-123. |
| |
| 作者姓名： | 李少芳 陈德礼 |
| |
| 作者单位： | 莆田学院,电子信息工程系,福建,莆田,351100 |
| |
| 摘 要： | 动态规划算法广泛应用于求解最优化问题中，通过对最小代价归并树问题的研究，构造出动态递归方程，分析其最优子结构以及重叠子问题性质，从而实现动态规划的过程分析，并用C程序生成最小代价归并树验证其有效性。
|
| 关 键 词： | 最小代价 归并树 动态规划 C程序 算法实现 |
| 文章编号： | 1672-2027（2007）03-0120-04 |
| 修稿时间： | 2007-07-04 |
Realiziing the Minimum COST Merging Tree with Dynamic Programming |
| |
| Li Shaofang,Chen Deli.Realiziing the Minimum COST Merging Tree with Dynamic Programming[J].Journal of Taiyuan Normal University:Natural Science Edition,2007,6(3):120-123. |
| |
| Authors: | Li Shaofang Chen Deli |
| |
| Institution: | Department of Electronics Information Engineering, Putian University, Putian 351100, China |
| |
| Abstract: | The dynamic programming algorithm is widely used to solve the optimization problems. There constructs the dynamic recurrence equation and analyses its quality including the optimum substruction and the overlapping subproblem through researching the minimum cost merging tree problem ,then realizes the process of the dynamic programming analyze ,and verifies its effectiveness by using C program to output the minimum cost merging tree. |
| |
| Keywords: | the minimum cost merging tree dynamic programming C program algorithm realizing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
