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

Celý popis

Podrobná bibliografia

Vydané v:	Mathematics and computers in simulation Ročník 228; s. 485 - 497
Hlavní autori:	Barrena, E., Bermudo, S., Hernández-Díaz, A.G., López-Sánchez, A.D., Zamudio, J.A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.2025
Predmet:	Dominating set Edge-weight Iterated greedy algorithm Metaheuristic algorithm Iterated greedy algorithm Dominating set Metaheuristic algorithm Edge-weight
ISSN:	0378-4754
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!