Title :
An Algorithm to Find the Constrained Steiner Tree in Halin Networks
Author :
Lu, Yunting ; Li, Zhenjun ; Li, Min
Author_Institution :
Shenzhen Inst. of Inf. Technol., Shenzhen, China
Abstract :
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.
Keywords :
computational complexity; multicast communication; optimisation; telecommunication network routing; trees (mathematics); Halin networks; NP hard problems; constrained Steiner tree problems; multicast routing; pseudoalgorithm; Algorithm design and analysis; Communication networks; Costs; Information technology; Joining processes; Polynomials; Routing; Steiner trees; Wheels; Halin networks; Steiner tree;
Conference_Titel :
Future Generation Communication and Networking, 2008. FGCN '08. Second International Conference on
Conference_Location :
Hainan Island
Print_ISBN :
978-0-7695-3431-2
DOI :
10.1109/FGCN.2008.51
