Abstract
The Steiner problem in networks is concerned with the determination of a minimum cost subnetwork connecting some (not necessarily all) vertices of an underlying network. The decision version of the Steiner problem is known to be NP-complete. However, if the underlying network is outerplanar or series-parallel, linear time algorithms have been developed. In this paper a linear time algorithm for the Steiner problem in Halin networks is presented. This result provides another example where the recursive structure of the underlying network leads to an efficient algorithm. Furthermore, the result is of interest from the network design point of view, since Halin networks are nontrivial generalizations of tree and ring networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
