Minimum weight clustered dominating tree problem

This data set corresponds to the instances used in the paper "Minimum weight clustered dominating tree problem" submitted to the European Journal of Operational Research.

Each file corresponds to an Euclidean instance. Nodes were randomly generated in a 100 x 100 square meters box. Two nodes i and j are connected by an edge {i,j} if their Euclidian distance is at most the value of the coverage radius in meters.

The file name is: "den"+"RadiusValue"+"mts"+"Nodes_"+"NumberOfNodes_"+"Sequential"+".txt"

The instance files of the Clustered Dominating Tree Problem contain in the first line the number of nodes |V| and of edges |E| of the connected undirected graph G=(V,E).

Line 1: |V| |E|

The remaining lines, one for each edge {i,j} in E, give the edge extremities i and j and its cost c(i,j).

Lines from 2 to |E|+1:
i j c(i,j)