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)

本数据集对应提交至《欧洲运筹学杂志（European Journal of Operational Research）》的论文《最小权聚类支配树问题（Minimum weight clustered dominating tree problem）》中所使用的实验实例。

每个文件对应一个欧几里得实例（Euclidean instance）。节点在100×100平方米的正方形区域内随机生成。若两个节点i与j的欧几里得距离（Euclidean distance）不超过该实例的覆盖半径（coverage radius，单位：米），则二者之间存在边{i,j}。

文件命名规则为：由den、覆盖半径数值、mts、Nodes_、节点总数、Sequential及.txt后缀拼接而成，具体格式为den[RadiusValue]mtsNodes_[NumberOfNodes]_Sequential.txt。

聚类支配树问题（Clustered Dominating Tree Problem）的实例文件首行包含连通无向图G=(V,E)的节点数|V|与边数|E|。
第1行：|V| |E|

剩余每一行对应边集E中的一条边{i,j}，依次给出边的两个端点i、j以及其权重c(i,j)。
第2行至第|E|+1行：
i j c(i,j)