Textes imprimés
Given a weighted graph G = (V, E, w), we investigate the problem of constructing a sequence of n = |V | subsets of vertices M1, . . . , Mn (called groups) with small diameters, where the diameter of a group is calculated using distances in G. The constraint on these n groups is that they must be inc...
