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...

Full description

Bibliographic Details
Authors: Casado, A., Bermudo, S., López-Sánchez, A.D., Sánchez-Oro, J.
Format: article
Publication Date:2022
Country:España
Institution:Universidad Rey Juan Carlos
Repository:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
OAI Identifier:oai:burjcdigital.urjc.es:10115/24521
Online Access:https://hdl.handle.net/10115/24521
Access Level:Open access
Keyword:Domination number
Minimum dominating set
Greedy heuristics
Iterated greedy
Exact algorithm
Description
Summary: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.

Similar Items