By Topic

An Algorithm to Find the Constrained Steiner Tree in Halin Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yunting Lu ; Shenzhen Inst. of Inf. Technol., Shenzhen, China ; Zhenjun Li ; Min Li

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.

Published in:

Future Generation Communication and Networking, 2008. FGCN '08. Second International Conference on  (Volume:1 )

Date of Conference:

13-15 Dec. 2008