Approximations to clustering and subgraph problems on trees |
| |
Authors: | Rainer Schrader |
| |
Institution: | Institut für Operations Research, Universität Bonn, Nassestr. 2, D-5300 Bonn, West Germany |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|