Abstract
Given a weighted complete graph G = (V, E; w) and a subset R⊆V, the Steiner tree problem (STP) is to find a minimum sub-tree of G interconnecting R. In this paper, we consider the relationship among the following 4 variables of STP: terminal Steiner tree problem (TSTP), partial-terminal Steiner tree problem (PTSTP), internal Steiner tree problem (ISTP) and selected-internal Steiner tree problem (SISTP). Firstly, we show that if SISTP has an approximation problem with approximation ratio, then ISTP also has an approximation algorithm with the same ratio. Then, we prove that the same result holds between PTSTP and TSTP.
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.
