多材料Terminal Steiner树拼接问题的近似算法研究Research on approximation algorithm for multi-material Terminal Steiner tree splicing
文永松,朱淑娟,庞一成
摘要(Abstract)：
在赋权连通网络下,给定多种材料及每种材料的费用和拼接费用,以便寻找赋权网络中的一棵Terminal Steiner树,并用给定材料连接此树,使得总费用及材料根数达到最小,记此问题为多材料Terminal Steiner树拼接问题。为了解决Terminal Steiner树拼接问题,首先分析Terminal Steiner树拼接问题是NP问题,不存在多项式时间算法;然后基于Steiner树问题和变尺寸装箱问题的近似算法及算法复杂度,给出多材料的Terminal Steiner树拼接问题的一个近似算法;最后证明算法的近似值及近似算法的时间复杂度。
关键词(KeyWords)： Terminal Steiner树;拼接问题;变尺寸装箱;近似算法;绝对近似比;时间复杂度
基金项目(Foundation): 国家自然科学基金(11761018);; 贵州省科学技术基金(J[2015]2026)~~
作者(Author): 文永松,朱淑娟,庞一成
DOI: 10.16652/j.issn.1004-373x.2018.10.007
参考文献(References)：
- [1]LIN G,XUE G.On the Terminal Steiner tree problem[J].Information processing letters,2002,84(2):103-107.
- [2]DRAKE D E,HOUGARDY S.On approximation algorithms for the Terminal Steiner tree problem[J].Information processing letters,2004,89(1):15-18.
- [3]MARTINEZ F V,PINA J C D,SOARES J.Algorithms for Terminal Steiner tree[C]//Proceedings of International Computing and Combinatorics Conference.Berlin:Springer,2005:369-379.
- [4]CHEN Y H.An improved approximation algorithm for the Terminal Steiner tree problem[C]//Proceedings of International Conference on Computational Science and Its Applications.Berlin:Springer,2011:141-151.
- [5]LEE C W,HUANG C W,PI W H,et al.An improved approximation ratio to the partial-Terminal Steiner tree problem[J].IEEE transactions on computers,2014,64(1):274-279.
- [6]FRIESEN D K,LANGSTON M A.Variable sized bin packing[J].SIAM journal on computing,1986,15(1):222-230.
- [7]KANG J,PARK S.Algorithms for the variable sized bin packing problem[J].European journal of operational research,2003,147(2):365-372.
- [8]EPSTEIN L,LEVIN A.An APTAS for generalized cost variablesized bin packing[J].SIAM journal on computing,2008,38(1):411-428.
- [9]JANSEN K,KRAFT S.An improved approximation scheme for variable-sized bin packing[J].Theory of computing systems,2016,59(2):262-322.
- [10]LI J,GE Y,HE S,et al.Approximation algorithms for constructing some required structures in digraphs[J].European journal of operational research,2014,232(2):307-314.
- [11]LI J,Guan L,DING H,et al.Approximations for constructing tree-form structures using specific material with fixed length[J].Optimization letters,2016,10(6):1-9.
- [12]VAZIRANI V V.Approximation algorithm[M].Berlin:Springer,2010.
- [13]ZELIKOVSKY A Z.A faster approximation algorithm for the Steiner tree problem in graphs[J].Information processing letters,1993,46(2):79-83.
- [14]KOU L,MARKOWSKY G,BERMAN L.A fast algorithm for Steiner trees[J].Acta informatica,1981,15(2):141-145.