Abstract
Publisher Summary This chapter considers some heuristics for the Steiner problem in graphs. The Steiner problem in graphs (networks) is to find a minimum cost tree T spanning a prescribed subset Z of vertices in a given graph G with positive edge costs. There exists a vast bibliography of the Steiner problem and thus the reader is referred to surveys. The Steiner problem is solvable in polynomial time for any fixed cardinality of Z, but, in general, it is an NP-hard problem even for special cases.
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.
