Abstract
An intuitive solution-doubling argument establishes well known results concerning the worst-case performance of spanning tree-based heuristics for the Steiner network problem and the traveling salesman problem. This note shows that the solution-doubling argument and its implications apply to certain more general Low Connectivity Steiner (LCS) problems that are important in the design of survivable telecommunication networks. We use the doubling strategy to establish worst-case upper bounds on the value of tree-based heuristics relative to the optimal value for some versions of the LCS problem, and also provide a tight lower bound based on solutions to matching problems.
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.
