A two-level meta-heuristic approach for the minimum dominating tree problem

Graphical abstract

References

[1] Zhang N, Shin I, Li B, Boyaci C, Tiwari R, Thai M T. 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] Shin I, Shen Y, Thai M T . On approximation of dominating tree in wireless sensor networks. Optimization Letters, 2010, 4( 3): 393–403

[3] Sundar S, Singh A . New heuristic approaches for the dominating tree problem. Applied Soft Computing, 2013, 13( 12): 4695–4703

[4] Chaurasia S N, Singh A . A hybrid heuristic for dominating tree problem. Soft Computing, 2016, 20( 1): 377–397

[5] Dražic Z, Čangalović M, Kovačević-Vujčić V . A metaheuristic approach to the dominating tree problem. Optimization Letters, 2017, 11( 6): 1155–1167

[6] Singh K, Sundar S . Two new heuristics for the dominating tree problem. Applied Intelligence, 2018, 48( 8): 2247–2267

[7] Hu S, Liu H, Wu X, Li R, Zhou J, Wang J . A hybrid framework combining genetic algorithm with iterated local search for the dominating tree problem. Mathematics, 2019, 7( 4): 359

[8] Wu X, Lü Z, Galinier P . Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks, 2017, 69( 2): 222–236

Acknowledgements

The research was supported by the National Natural Science Foundation of China (Grant Nos. 61902116, 62002105, 62201203) and the Science and Technology Research Program of Hubei Province (2021BLB171).

Supporting Information

The supporting information is available online at journal.hep.com.cn and link.springer.com.

RIGHTS & PERMISSIONS

2023 Higher Education Press