Abstract
AbstractThe prize‐collecting Steiner tree problem is well known to be NP‐hard. We consider seven variations of this problem generalizing several well‐studied bottleneck and minsum problems with feasible solutions as trees of a graph. Four of these problems are shown to be solvable in O(m+n log n) time and the remaining are shown to be NP‐hard where n is the number of nodes and m is the number of edges in the underlying graph. For one of these polynomially solvable cases, we also provide an O(m) algorithm generalizing and unifying known linear time algorithms for the bottleneck spanning tree problem, bottleneck s−t path problem, and bottleneck Steiner tree problem. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(4), 199–205 2006
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.
