计算机工程与应用 ›› 2014, Vol. 50 ›› Issue (7): 67-70.
• 理论研究、研发设计 • 上一篇 下一篇
刘艳芳,宁爱兵,王英磊
出版日期:
发布日期:
LIU Yanfang, NING Aibing, WANG Yinglei
Online:
Published:
摘要: 图的Steiner最小树问题是经典的组合优化问题,是一个NP难题,在不同的领域有着广泛的应用。研究该问题的部分数学性质,在此基础上给出了该问题的初步降阶方法和下界子方法,形成一个新的回溯算法。该算法具有较低的时间复杂度,还给出了应用实例及其分析。
关键词: 图的Steiner最小树, 最小生成树, 回溯法, 降阶算法
Abstract: Graphical Steiner Minimum Tree Problem(GSMTP) is a well-known optimization problem, which is a NP-hard problem and has many applications in various fields. This paper gives some mathematical properties of GSMTP, then proposes a reduction method and a method to calculate the lower bound of the GSMTP. The paper presents a backtracking algorithm for GSMTP which includes the lower bound method. It is proved to be efficient and can decrease the time complexity. In addition, series of examples and instances are solved and analyzed.
Key words: graphical Steiner minimum tree, minimum spanning tree, backtracking algorithm, reduction algorithm
刘艳芳,宁爱兵,王英磊. 图的Steiner最小树问题的降阶回溯算法[J]. 计算机工程与应用, 2014, 50(7): 67-70.
LIU Yanfang, NING Aibing, WANG Yinglei. Reduced-order backtracking algorithm for Graphical Steiner Minimum Tree Problem[J]. Computer Engineering and Applications, 2014, 50(7): 67-70.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2014/V50/I7/67