A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem.
Ruizhi LiJintao HeCuisong LinYing LiuShuli HuMinghao YinPublished in: Neural Comput. Appl. (2024)
Keyphrases
- connected dominating set
- search algorithm
- dominating set
- facility location problem
- frequency hopping
- optimal configuration
- heuristic search
- branch and bound
- search space
- data driven
- search tree
- computational complexity
- selection algorithm
- column generation
- hill climbing
- low frequency
- multiple access
- approximation algorithms
- multistage
- tabu search