This archive is distributed in association with the XXX under the MIT License.
The data in this repository were used in the research reported in the paper XXX by Zhong et al.
To cite the contents of this repository, please cite both the paper and this repo, using their respective DOIs.
XXX
Below is the BibTex for citing this snapshot of the repository.
@misc{CacheTest,
author = {Zhong, Haonan and Mahdavi Pajouh, Foad and Butenko, Sergiy and Prokopyev, Oleg A.},
publisher = {XXX},
title = {{On exact approaches for interdicting connected dominating sets}},
year = {2025},
doi = {XXX},
url = {[https://github.com/xlxr/CIP](https://github.com/xlxr/CIP)},
note = {Available for download at [https://github.com/xlxr/CIP](https://github.com/xlxr/CIP)},
}
Source codes and data set used in the “On exact approaches for interdicting connected” paper. The data set contains 15 randomly generated networks and 16 real-life networks. Each file contains 1 + X + Y lines, where X and Y are the number of vertices and the number of edges in the network, respectively. It starts with two numbers indicating the number of vertices X and the number of edges Y. Then, it follows with X lines of one number. Note that we do not assign indices to the vertices. The index of a vertex is the same as the line number it appears on. The number in each line is the weight of a vertex. The last Y lines contain three numbers. The first and second numbers in each line are the head and the tail of an edge. Note that the edges are undirected. The third number is the blocking cost of an edge.