Article ID: | iaor2007922 |
Country: | United States |
Volume: | 47 |
Issue: | 4 |
Start Page Number: | 199 |
End Page Number: | 205 |
Publication Date: | Jul 2006 |
Journal: | Networks |
Authors: | Punnen Abraham P., Chapovska Olena |
Keywords: | Steiner problem |
The 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