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...
| Autores: | , , , |
|---|---|
| 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 |
| Sumario: | 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. |
|---|