This article deals with the problem of partitioning a graph into
connected components by optimizing some balancing objective functions related to the vertex weights. Objective functions based on the
gap or
range of the partition's components, that is, the difference between the maximum and minimum weight of a vertex in the component, have been already introduced in the literature. Here we...