Abstract
Given a tree with vertex weights, we derive fully polynomial approximation schemes for the following two NP-hard problems: (i) Partition the graph into connected cluster sets such that the weight of each set does not exceed a given bound and a monotone objective function is minimized. (ii) Find a subtree with bounded vertex weight such that a monotone objective function is maximized.
Full Text
Published Version
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 call