Abstract
AbstractThe Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge‐weighted (undirected) graph. In the more general Node‐weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning tree model is adjusted for the NSP as well as for the Steiner Forest Problem, a newly introduced generalization. The NSP is related to the Directed Steiner Problem. Reduction tests for the SP, reducing the size of the problem graph, are adapted for these generalizations and some new tests are developed.
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.
