Skip to Main Content
Searching Steiner tree problem is important for optimizing the multicast routing in communication networks. In this paper, we study the problem of searching weight constrained minimum cost Steiner tree problem in Halin networks where each edge has a nonnegative integer cost and a nonnegative integer weight. It has been proved to be NP hard. In this paper, we give a pseudo algorithm to find the constrained Steiner tree in Halin networks.