Abstract
The terminal Steiner tree problem ( TST ) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2 ρ − ρ / ( 3 ρ − 2 ) approximation algorithm for the TST , where ρ is the approximation factor of a given algorithm for the Steiner tree problem. Considering the current best value of ρ , this improves a previous 3.10 factor to 2.52. For the TST restricted to instances where all edge costs are either 1 or 2, we improve the approximation factor from 1.60 to 1.42.
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.
