A hybrid population-based algorithm for solving the Minimum Dominating Set Problem
Abstract
The Minimum Dominating Sets (MDS) problem is pivotal across diverse fields like social networks and ad hoc wireless networks, representing a significant NP-complete challenge in graph theory. To tackle this, we propose a novel hybrid cuckoo search approach. While cuckoo search is renowned for its wide search space exploration, we enhance it with intensification methods and genetic crossover operators for improved performance. Comprehensive experimental evaluations against state-of-the-art techniques validate our approach's effectiveness.
Downloads
Published
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).