An Approximation Algorithm about Full Steiner Tree Problem
Tang Heng-yong · Journal of Heze University · 2006
The full Steiner tree problem(TST) is to find a minimum weight Steiner tree with all the vertices of its leaves.Fabio Viduani Martinez and other people presented a approximation algorithm,where is the approximation ratio of the algorithm for the regular graph Steiner tree problem.For now,its minimum value is approximate 1.550.In this paper,about this full Steiner tree problem we give an approximation algorithm with an improved approximation ratio of(currently).