Computer Engineering and Applications ›› 2014, Vol. 50 ›› Issue (7): 67-70.

Previous Articles     Next Articles

Reduced-order backtracking algorithm for Graphical Steiner Minimum Tree Problem

LIU Yanfang, NING Aibing, WANG Yinglei   

  1. School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China
  • Online:2014-04-01 Published:2014-04-25

图的Steiner最小树问题的降阶回溯算法

刘艳芳,宁爱兵,王英磊   

  1. 上海理工大学 管理学院,上海 200093

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最小树问题是经典的组合优化问题,是一个NP难题,在不同的领域有着广泛的应用。研究该问题的部分数学性质,在此基础上给出了该问题的初步降阶方法和下界子方法,形成一个新的回溯算法。该算法具有较低的时间复杂度,还给出了应用实例及其分析。

关键词: 图的Steiner最小树, 最小生成树, 回溯法, 降阶算法