An iterated greedy algorithm for finding the minimum dominating set in graphs

A. Casado and J. Sánchez-Oro are supported by the “Ministerio de Ciencia e Innovación, Spain”, Grant Ref. PID2021-125709OA-C22, and by “Comunidad de Madrid” and “Fondos Estructurales” of European Union with Grant Refs. S2018/TCS-4566, Y2018/EMT-5062. S. Bermudo and A.D. López-Sánchez acknowledge sup...

Descripción completa

Detalles Bibliográficos
Autores: Casado, A., Bermudo, S., López-Sánchez, A.D., Sánchez-Oro, J.
Tipo de recurso: artículo
Fecha de publicación:2022
País:España
Institución:Universidad Rey Juan Carlos
Repositorio:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
OAI Identifier:oai:burjcdigital.urjc.es:10115/24521
Acceso en línea:https://hdl.handle.net/10115/24521
Access Level:acceso abierto
Palabra clave:Domination number
Minimum dominating set
Greedy heuristics
Iterated greedy
Exact algorithm
id ES_3b8e89208e642eadd3fafec6997bc9ff
oai_identifier_str oai:burjcdigital.urjc.es:10115/24521
network_acronym_str ES
network_name_str España
repository_id_str
spelling An iterated greedy algorithm for finding the minimum dominating set in graphsCasado, A.Bermudo, S.López-Sánchez, A.D.Sánchez-Oro, J.Domination numberMinimum dominating setGreedy heuristicsIterated greedyExact algorithmA. Casado and J. Sánchez-Oro are supported by the “Ministerio de Ciencia e Innovación, Spain”, Grant Ref. PID2021-125709OA-C22, and by “Comunidad de Madrid” and “Fondos Estructurales” of European Union with Grant Refs. S2018/TCS-4566, Y2018/EMT-5062. S. Bermudo and A.D. López-Sánchez acknowledge support from the Junta de Andalucía, FEDER-UPO Research & Development Call, Spain , reference number UPO-1263769.A dominating set in a graph is a set of vertices such that every vertex outside the set is adjacent to a vertex in the set. The domination number is the minimum cardinality of a dominating set in the graph. The problem of finding the minimum dominating set is a combinatorial optimization problem that has been proved to be N P-hard. Given the difficulty of this problem, an Iterated Greedy algorithm is proposed for its solution and it is compared to the solution given by an exact algorithm and by the state-of-art algorithms. Computational results show that the proposal is able to find optimal or near-optimal solutions within a short computational time. Specifically, from the set of instances which can be optimally solved, the proposed method presents an average deviation of 0.04%. Regarding the more complex set of instances, where the exact method is not able to reach the optimal value, the proposed method achieves an average deviation of 1.23% with respect to the best-known solution.Elsevier202320232022info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/10115/24521reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlosinstname:Universidad Rey Juan CarlosInglésAtribución 4.0 Internacionalhttp://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessoai:burjcdigital.urjc.es:10115/245212026-06-24T12:48:17Z
dc.title.none.fl_str_mv An iterated greedy algorithm for finding the minimum dominating set in graphs
title An iterated greedy algorithm for finding the minimum dominating set in graphs
spellingShingle An iterated greedy algorithm for finding the minimum dominating set in graphs
Casado, A.
Domination number
Minimum dominating set
Greedy heuristics
Iterated greedy
Exact algorithm
title_short An iterated greedy algorithm for finding the minimum dominating set in graphs
title_full An iterated greedy algorithm for finding the minimum dominating set in graphs
title_fullStr An iterated greedy algorithm for finding the minimum dominating set in graphs
title_full_unstemmed An iterated greedy algorithm for finding the minimum dominating set in graphs
title_sort An iterated greedy algorithm for finding the minimum dominating set in graphs
dc.creator.none.fl_str_mv Casado, A.
Bermudo, S.
López-Sánchez, A.D.
Sánchez-Oro, J.
author Casado, A.
author_facet Casado, A.
Bermudo, S.
López-Sánchez, A.D.
Sánchez-Oro, J.
author_role author
author2 Bermudo, S.
López-Sánchez, A.D.
Sánchez-Oro, J.
author2_role author
author
author
dc.subject.none.fl_str_mv Domination number
Minimum dominating set
Greedy heuristics
Iterated greedy
Exact algorithm
topic Domination number
Minimum dominating set
Greedy heuristics
Iterated greedy
Exact algorithm
description A. Casado and J. Sánchez-Oro are supported by the “Ministerio de Ciencia e Innovación, Spain”, Grant Ref. PID2021-125709OA-C22, and by “Comunidad de Madrid” and “Fondos Estructurales” of European Union with Grant Refs. S2018/TCS-4566, Y2018/EMT-5062. S. Bermudo and A.D. López-Sánchez acknowledge support from the Junta de Andalucía, FEDER-UPO Research & Development Call, Spain , reference number UPO-1263769.
publishDate 2022
dc.date.none.fl_str_mv 2022
2023
2023
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/10115/24521
url https://hdl.handle.net/10115/24521
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv Atribución 4.0 Internacional
http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Atribución 4.0 Internacional
http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
instname:Universidad Rey Juan Carlos
instname_str Universidad Rey Juan Carlos
reponame_str BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
collection BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406313703800832
score 15,812429

Similares en LA Referencia