Proceedings

NuMDS: An Efficient Local Search Algorithm for Minimum Dominating Set Problem

Download BibTeX Cite

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 8966-8976.

https://doi.org/10.24963/ijcai.2025/997

Abstract

The minimum dominating set (MDS) problem is a crucial NP-hard combinatorial optimization problem with wide applications in real-world scenarios. In this paper, we propose an efficient local search algorithm namely NuMDS to solve the MDS, which comprises three key ideas. First, we introduce a dominate propagation-based reduction method that fixes a portion of vertices in a given graph. Second, we develop a novel two-phase initialization method based on the decomposition method. Third, we propose a multi-stage local search procedure, which adopts three different search manners according to the current stage of the search. We conduct extensive experiments to demonstrate the outstanding effectiveness of NuMDS, and the results clearly indicate that NuMDS outperforms previous state-of-the-art algorithms on almost all instances.

Rui Sun, Zhaohui Liu, Yiyuan Wang, Han Xiao, Jiangnan Li, and Jiejiang Chen. 2025. NuMDS: An Efficient Local Search Algorithm for Minimum Dominating Set Problem. In Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-25. IJCAI, 8966–8976. https://doi.org/10.24963/ijcai.2025/997
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards