Now showing items 1-1 of 1
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs [Article]
This paper deals with the following graph partitioning problem. Consider a connected graph with n nodes, p of which are centers, while the remaining ones are units. For each unit-center pair there is a fixed service cost ...