{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T05:08:02Z","timestamp":1739596082504,"version":"3.37.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T00:00:00Z","timestamp":1739491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T00:00:00Z","timestamp":1739491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402164"],"award-info":[{"award-number":["62402164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07014-2","type":"journal-article","created":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T07:56:32Z","timestamp":1739519792000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An adaptive focal distance tabu search approach for the minimum 2-connected dominating set problem"],"prefix":"10.1007","volume":"81","author":[{"given":"Mao","family":"Luo","sequence":"first","affiliation":[]},{"given":"Xianhong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xinyun","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Caiquan","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Yuanzhi","family":"Ke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,14]]},"reference":[{"key":"7014_CR1","unstructured":"Kann V (1992) On the approximability of NP-complete optimization problems. Ph.D. thesis, Royal Institute of Technology Stockholm"},{"key":"7014_CR2","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.endm.2013.05.120","volume":"41","author":"VL do Forte","year":"2013","unstructured":"do Forte VL, Lucena A, Maculan N (2013) Formulations for the minimum 2-connected dominating set problem. Electron Notes Discrete Math 41:415\u2013422","journal-title":"Electron Notes Discrete Math"},{"issue":"6","key":"7014_CR3","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft JE, Tarjan RE (1973) Efficient algorithms for graph manipulation [h] (algorithm 447). Commun ACM 16(6):372\u2013378","journal-title":"Commun ACM"},{"key":"7014_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106206","volume":"174","author":"FN Abu-Khzam","year":"2022","unstructured":"Abu-Khzam FN (2022) An improved exact algorithm for minimum dominating set in chordal graphs. Inf Process Lett 174:106206","journal-title":"Inf Process Lett"},{"key":"7014_CR5","doi-asserted-by":"crossref","unstructured":"Cai S, Hou W, Wang Y et\u00a0al (2021) Two-goal local search and inference rules for minimum dominating set. In: Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, pp 1467\u20131473","DOI":"10.24963\/ijcai.2020\/204"},{"key":"7014_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00446-013-0186-z","volume":"26","author":"C Lenzen","year":"2013","unstructured":"Lenzen C, Pignolet YA, Wattenhofer R (2013) Distributed minimum dominating set approximations in restricted families of graphs. Distrib Comput 26:119\u2013137","journal-title":"Distrib Comput"},{"key":"7014_CR7","doi-asserted-by":"publisher","first-page":"188269","DOI":"10.1109\/ACCESS.2020.3030802","volume":"8","author":"MK Dholey","year":"2020","unstructured":"Dholey MK, Sinha D, Mukherjee S et al (2020) A novel broadcast network design for routing in mobile ad-hoc network. IEEE Access 8:188269\u2013188283","journal-title":"IEEE Access"},{"issue":"3.1","key":"7014_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.14419\/ijet.v7i3.1.16801","volume":"7","author":"A Kaur","year":"2018","unstructured":"Kaur A, Singh G, Gupta R (2018) Limiting the excess broadcast in multipath routing using ant colony optimization. Int J Eng Technol 7(3.1):70\u201374","journal-title":"Int J Eng Technol"},{"key":"7014_CR9","doi-asserted-by":"crossref","unstructured":"Omar N, Yaakob N, Farook RS et\u00a0al (2018) A network coding-aware directional broadcast routing scheme for vanet. In: MATEC Web of Conferences, EDP Sciences, p 06012","DOI":"10.1051\/matecconf\/201815006012"},{"key":"7014_CR10","first-page":"1","volume":"22","author":"J Biswas","year":"2019","unstructured":"Biswas J, Ray M, Sondur S et al (2019) Coordinated power management in data center networks. Sustainable Computing: Informatics and Systems 22:1\u201312","journal-title":"Sustainable Computing: Informatics and Systems"},{"issue":"1","key":"7014_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13673-015-0021-6","volume":"5","author":"A Pughat","year":"2015","unstructured":"Pughat A, Sharma V (2015) A review on stochastic approach for dynamic power management in wireless sensor networks. Human-centric Comput Inf Sci 5(1):1\u201314","journal-title":"Human-centric Comput Inf Sci"},{"key":"7014_CR12","doi-asserted-by":"publisher","first-page":"699","DOI":"10.4028\/www.scientific.net\/AMM.721.699","volume":"721","author":"WL Li","year":"2015","unstructured":"Li WL, Xie HJ (2015) The design of the power energy management system based on wireless sensor network. Appl Mech Mater 721:699\u2013702","journal-title":"Appl Mech Mater"},{"key":"7014_CR13","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.comcom.2022.03.005","volume":"188","author":"A Khatiri","year":"2022","unstructured":"Khatiri A, Mirjalily G (2022) A cost-efficient, load-balanced and fragmentation-aware approach for deployment of vnf service chains in elastic optical networks. Comput Commun 188:156\u2013166","journal-title":"Comput Commun"},{"key":"7014_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.osn.2021.100607","volume":"41","author":"J Thangaraj","year":"2021","unstructured":"Thangaraj J et al (2021) Multi-path provisioning in elastic optical network with dynamic on-request optimal defragmentation strategy. Opt Switch Netw 41:100607","journal-title":"Opt Switch Netw"},{"issue":"1","key":"7014_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4097","volume":"32","author":"S Miladi\u0107-Te\u0161i\u0107","year":"2021","unstructured":"Miladi\u0107-Te\u0161i\u0107 S, Markovi\u0107 G, Nonkovi\u0107 N et al (2021) A metaheuristic approach for source traffic grooming in elastic optical networks. Trans Emerg Telecommun Technol 32(1):e4097","journal-title":"Trans Emerg Telecommun Technol"},{"issue":"5","key":"7014_CR16","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1109\/TNET.2012.2227791","volume":"21","author":"W Wang","year":"2012","unstructured":"Wang W, Kim D, An MK et al (2012) On construction of quality fault-tolerant virtual backbone in wireless networks. IEEE\/ACM Trans Netw 21(5):1499\u20131510","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"7014_CR17","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TWC.2009.051053","volume":"8","author":"F Wang","year":"2009","unstructured":"Wang F, Thai MT, Du DZ (2009) On the construction of 2-connected virtual backbone in wireless networks. IEEE Trans Wirel Commun 8(3):1230\u20131237","journal-title":"IEEE Trans Wirel Commun"},{"key":"7014_CR18","unstructured":"Morgan M, Grout V (2008) Finding optimal solutions to backbone minimisation problems using mixed integer programming. In: INC, pp 53\u201363"},{"issue":"1","key":"7014_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/ijoc.2014.0619","volume":"27","author":"A Buchanan","year":"2015","unstructured":"Buchanan A, Sung JS, Butenko S et al (2015) An integer programming approach for fault-tolerant connected dominating sets. INFORMS J Comput 27(1):178\u2013188","journal-title":"INFORMS J Comput"},{"key":"7014_CR20","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ipl.2018.08.003","volume":"140","author":"Z Nutov","year":"2018","unstructured":"Nutov Z (2018) Improved approximation algorithms for $$k$$-connected $$m$$-dominating set problems. Inf Process Lett 140:30\u201333","journal-title":"Inf Process Lett"},{"issue":"1","key":"7014_CR21","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s10878-014-9720-6","volume":"31","author":"Y Shi","year":"2016","unstructured":"Shi Y, Zhang Y, Zhang Z et al (2016) A greedy algorithm for the minimum 2-connected $$m$$-fold dominating set problem. J Comb Optim 31(1):136\u2013151","journal-title":"J Comb Optim"},{"key":"7014_CR22","unstructured":"Jovanovic R, Bayram IS, Voss S (2016) A grasp approach for solving the 2-connected m-dominating set problem. arXiv preprint. arXiv:1609.05662"},{"issue":"3","key":"7014_CR23","doi-asserted-by":"publisher","first-page":"775","DOI":"10.2298\/AADM190227052J","volume":"14","author":"R Jovanovic","year":"2020","unstructured":"Jovanovic R, Vo\u00df S (2020) A matheuristic approach for solving the 2-connected dominating set problem. Appl. Anal. Discrete Math. 14(3):775\u2013799","journal-title":"Appl. Anal. Discrete Math."},{"issue":"5","key":"7014_CR24","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s10878-024-01175-1","volume":"47","author":"M Luo","year":"2024","unstructured":"Luo M, Qin H, Wu X et al (2024) A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem. J. Comb. Optim. 47(5):72","journal-title":"J. Comb. Optim."},{"key":"7014_CR25","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s11276-014-0819-6","volume":"21","author":"N Ahn","year":"2015","unstructured":"Ahn N, Park S (2015) An optimization algorithm for the minimum $$k$$-connected $$m$$-dominating set problem in wireless sensor networks. Wirel. Netw. 21:783\u2013792","journal-title":"Wirel. Netw."},{"issue":"2","key":"7014_CR26","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1002\/net.21728","volume":"69","author":"X Wu","year":"2017","unstructured":"Wu X, L\u00fc Z, Galinier P (2017) Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks 69(2):222\u2013236","journal-title":"Networks"},{"key":"7014_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-020-3115-5","volume":"64","author":"F Glover","year":"2021","unstructured":"Glover F, L\u00fc Z (2021) Focal distance tabu search. Sci. China Inf. Sci. 64:1\u201312","journal-title":"Sci. China Inf. Sci."},{"key":"7014_CR28","doi-asserted-by":"crossref","unstructured":"Baswana S, Chaudhury SR, Choudhary K, et\u00a0al (2016) Dynamic dfs in undirected graphs: breaking the o (m) barrier. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp 730\u2013739","DOI":"10.1137\/1.9781611974331.ch52"},{"issue":"3","key":"7014_CR29","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10287-009-0116-5","volume":"7","author":"A Lucena","year":"2010","unstructured":"Lucena A, Maculan N, Simonetti L (2010) Reformulations and solution algorithms for the maximum leaf spanning tree problem. Comput Manag Sci 7(3):289\u2013311","journal-title":"Comput Manag Sci"},{"key":"7014_CR30","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: AAAI. https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07014-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07014-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07014-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T07:56:37Z","timestamp":1739519797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07014-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,14]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["7014"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07014-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,14]]},"assertion":[{"value":"30 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"501"}}