[1] [1] Gibert, POLLAK Η O.Steiner minimal tree|Jl. SLAM J. Appl. Afoife.,16,1968

[2] [2] GAREY Μ R.JOHNSON D S.Computers and Intractability: A Guide to Theoiy of NP-completeness [М]. San Francisco CA: Freeman. 1979

[3] [3] I. CWamtac.A. Farago, T. Zhang. Iightpaih (wavelength) routing in large WDM networks [J]. IEEE JSAC, 1996,14(5): 909-913

[4] [4] HWANG F K,RICHARDS D S.Steiner tree problem [J]. Networks, 1992,22(1): 55-89

[5] [5] Deying Li et al.. Minimizing number of wavelength in multicasting routing trees in WDM networks [J]. Networks, 2000,36(4): 260-265

[6] [6] Pawel Winter. Steiner problem in networks: A Survey [J]. IEEE Network, 1987,3(2): 129~ 167