|
|
|
A two-level meta-heuristic approach for the minimum dominating tree problem |
Caiquan XIONG, Hang LIU, Xinyun WU( ), Na DENG |
| School of Computer Science, Hubei University of Technology, Wuhan 430068, China |
|
|
|
|
|
|
Corresponding Author(s):
Xinyun WU
|
|
Just Accepted Date: 09 October 2022
Issue Date: 12 December 2022
|
|
| 1 |
N, Zhang I, Shin B, Li C, Boyaci R, Tiwari M T Thai . New approximation for minimum-weight routing backbone in wireless sensor network. In: Proceedings of the 3rd International Conference on Wireless Algorithms, Systems, and Applications. 2008
|
| 2 |
I, Shin Y, Shen M T Thai . On approximation of dominating tree in wireless sensor networks. Optimization Letters, 2010, 4( 3): 393–403
|
| 3 |
S, Sundar A Singh . New heuristic approaches for the dominating tree problem. Applied Soft Computing, 2013, 13( 12): 4695–4703
|
| 4 |
S N, Chaurasia A Singh . A hybrid heuristic for dominating tree problem. Soft Computing, 2016, 20( 1): 377–397
|
| 5 |
Z, Dražic M, Čangalović V Kovačević-Vujčić . A metaheuristic approach to the dominating tree problem. Optimization Letters, 2017, 11( 6): 1155–1167
|
| 6 |
K, Singh S Sundar . Two new heuristics for the dominating tree problem. Applied Intelligence, 2018, 48( 8): 2247–2267
|
| 7 |
S, Hu H, Liu X, Wu R, Li J, Zhou J Wang . A hybrid framework combining genetic algorithm with iterated local search for the dominating tree problem. Mathematics, 2019, 7( 4): 359
|
| 8 |
X, Wu Z, Lü P Galinier . Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks, 2017, 69( 2): 222–236
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
