An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem
The Journal of Supercomputing · 14.02.2025 · 81 (3)
DOI: 10.1007/s11227-025-07014-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Supercomputing, online erschienen am 14.02.2025. Verfasst von Mao Luo und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 30 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Luo, M., Liu, X., Wu, X., Xiong, C., & Ke, Y. (2025). An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem. The Journal of Supercomputing, 81(3). https://doi.org/10.1007/s11227-025-07014-2
Vancouver
Luo M, Liu X, Wu X, Xiong C, Ke Y. An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem. The Journal of Supercomputing. 2025;81(3). doi:10.1007/s11227-025-07014-2
BibTeX
@article{Luo2025,
author = {Luo, Mao and Liu, Xianhong and Wu, Xinyun and Xiong, Caiquan and Ke, Yuanzhi},
title = {An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem},
journal = {The Journal of Supercomputing},
year = {2025},
volume = {81},
number = {3},
doi = {10.1007/s11227-025-07014-2}
}
EUVIMED