Variations of the prize-collecting Stein
β
Olena Chapovska; Abraham P. Punnen
π
Article
π
2006
π
John Wiley and Sons
π
English
β 136 KB
## Abstract 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 __O__(__m_