The following publications are possibly variants of this publication:
- Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local SearchBohan Li, Kai Wang, Yiyuan Wang, Shaowei Cai. cp 2021: [doi]
- A restart local search algorithm with relaxed configuration checking strategy for the minimum k-dominating set problemRuizhi Li, Siqi Liu, Fangzhou Wang, Jian Gao 0007, Huan Liu, Shuli Hu, Minghao Yin. kbs, 254:109619, 2022. [doi]
- NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating SetBohan Li, Xindi Zhang, Shaowei Cai, Jinkun Lin, Yiyuan Wang, Christian Blum. IJCAI 2020: 1503-1510 [doi]
- An efficient local search algorithm for minimum positive influence dominating set problemRui Sun, Jieyu Wu, Chenghou Jin, Yiyuan Wang, Wenbo Zhou, Minghao Yin. cor, 154:106197, June 2023. [doi]
- An Efficient Local Search Algorithm for the Minimum k-Dominating Set ProblemRuizhi Li, Huan Liu, Xiaoli Wu, Jun Wu, Minghao Yin. access, 6:62062-62075, 2018. [doi]
- Algorithms for Minimum Connected capacitated Dominating Set ProblemWeiping Shang, Xiumei Wang. dmaa, 3(1):9-16, 2011. [doi]
- A new local search algorithm with greedy crossover restart for the dominating tree problemDangdang Niu, Bin Liu, Minghao Yin, Yupeng Zhou. eswa, 229(Part A):120353, November 2023. [doi]