Abstract
The Steiner Problem in Graphs is the problem of, given a weighted graph G and a subset S of the vertices of G, constructing a tree of minimum total weight connecting all the vertices in S. We consider an extension of this problem, called the Edge Disjolnt Steiner Problem In Graphs. It seeks to improve the reliability of the solution by requiring two (or more) seperate trees spanning S. Finding a feasible solution to this problem is shown to be NPâcomplete. Two relaxations of the problem are presented, which are used to compute a lower bound to the problem. Both relaxations can also be exploited for upper bound generation. Computational results are given for graphs with up to 100 vertices and 4950 edges.
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.
