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

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Ruizhi Li, Huan Liu, Xiaoli Wu, Jun Wu, Minghao Yin
Format: article
Langue:EN
Publié: IEEE 2018
Sujets:
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
Accès en ligne:https://doaj.org/article/b53fcef925c64cfcba53693c05b54eb1
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

Internet

https://doaj.org/article/b53fcef925c64cfcba53693c05b54eb1

Documents similaires