Massive Instances for the MIDS problem
收藏资源简介:
In the paper "An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem", by Pan et. al., 2023, published in Front. Comput. Sci., 17(4): 174326 <https://doi.org/10.1007/s11704-022-2023-7>, the authors use a dataset of massive networks to test heuristic methods of finding solutions for the Minimum Independent Dominating Set (MIDS) problem. I am doing my own research on the MIDS problem, and I found that even when finding these instances on the Network Repository <https://networkrepository.com/>, they are not standirdized, making dificcult to work with them. Thus, I have standardized all instances to the Matrix Market file format (.mtx) and compressed then with 7ZIP <https://www.7-zip.org/> to the .7z format, as this was more space efficient than compressing to the .zip format. I choose the Creative Commons Share Alike license as it is the same used by the Network Repository, where I originally got the data. I hope this can be useful to anyone who will work with these instances for the MIDS problem or any other problem in the future.



