An Efficient Local Search Algorithm for the Minimum <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Dominating Set Problem

An Efficient Local Search Algorithm for the Minimum <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Dominating Set Problem

The minimum <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-dominating set (MKDS) problem, a generalization of the classical minimum dominating set problem, is an important NP-hard combinatorial optimization problem with various applicat...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Ruizhi Li, Huan Liu, Xiaoli Wu, Jun Wu, Minghao Yin
Formato: article
Lenguaje:EN
Publicado: IEEE 2018
Materias:
Heuristic
local search
minimum <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-dominating set problem
Electrical engineering. Electronics. Nuclear engineering
TK1-9971
Acceso en línea:https://doaj.org/article/b53fcef925c64cfcba53693c05b54eb1
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Internet

https://doaj.org/article/b53fcef925c64cfcba53693c05b54eb1

Ejemplares similares