Finding the minimum k-weighted dominating sets using heuristic algorithms

In this work, we propose, analyze, and solve a generalization of the k-dominating set problem in a graph, when we consider a weighted graph. Given a graph with weights in its edges, a set of vertices is a k-weighted dominating set if for every vertex outside the set, the sum of the weights from it t...

Full description

Bibliographic Details

Published in:	Mathematics and computers in simulation Vol. 228; pp. 485 - 497
Main Authors:	Barrena, E., Bermudo, S., Hernández-Díaz, A.G., López-Sánchez, A.D., Zamudio, J.A.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2025
Subjects:	Dominating set Edge-weight Iterated greedy algorithm Metaheuristic algorithm Iterated greedy algorithm Dominating set Metaheuristic algorithm Edge-weight
ISSN:	0378-4754
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!