{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T19:17:30Z","timestamp":1792783050477,"version":"4.5.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T00:00:00Z","timestamp":1790121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T00:00:00Z","timestamp":1790121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Higher Education Institutions Scientific Research Foundation of Hebei Province of China","award":["QN2025038"],"award-info":[{"award-number":["QN2025038"]}]},{"name":"the Science and Technology Foundation of Hebei Normal University","award":["L2025B03"],"award-info":[{"award-number":["L2025B03"]}],"id":[{"id":"https:\/\/ror.org\/004rbbw49","id-type":"ROR","asserted-by":"crossref"}]},{"name":"the Science and Technology Program of Hebei Province","award":["246Z7605G"],"award-info":[{"award-number":["246Z7605G"]}]},{"name":"the Interdisciplinary Research Foundation of Hebei Normal University","award":["L2024J01"],"award-info":[{"award-number":["L2024J01"]}],"id":[{"id":"https:\/\/ror.org\/004rbbw49","id-type":"ROR","asserted-by":"crossref"}]},{"name":"the NSF of Hebei Province of China","award":["A2023205009"],"award-info":[{"award-number":["A2023205009"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1007\/s10878-026-01474-9","type":"journal-article","created":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T05:35:09Z","timestamp":1790141709000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Greedy approximation for the minimum (1,\u00a0m)-connected dominating set with labeling"],"prefix":"10.1007","volume":"52","author":[{"given":"Tianshuo","family":"Lv","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9792-8360","authenticated-orcid":false,"given":"Ke","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,23]]},"reference":[{"issue":"8","key":"1474_CR1","doi-asserted-by":"publisher","first-page":"3531","DOI":"10.3390\/app14083531","volume":"14","author":"SS Borah","year":"2024","unstructured":"Borah SS, Khanal A, Sundaravadivel P (2024) Emerging technologies for automation in environmental sensing. App Sci 14(8):3531","journal-title":"App Sci"},{"key":"1474_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.matcom.2022.12.018","volume":"207","author":"A Casado","year":"2023","unstructured":"Casado A, Bermudo S, L\u00f3pez-S\u00e1nchez AD, S\u00e1nchez-Oro J (2023) An iterated greedy algorithm for finding the minimum dominating set in graphs. Math Comput Simulation 207:41\u201358","journal-title":"Math Comput Simulation"},{"key":"1474_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"R Chang","year":"1997","unstructured":"Chang R, Leu S (1997) The minimum labeling spanning trees. Inf Process Lett 63:277\u2013282","journal-title":"Inf Process Lett"},{"key":"1474_CR4","unstructured":"Chaudhuri S, Hj\u00e1lmt\u00fdsson G, Yates J (2000) Control of lightpaths in an optical network. IETF Internet Draft"},{"issue":"4","key":"1474_CR5","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X Cheng","year":"2003","unstructured":"Cheng X, Huang X, Li D, Wu W, Du DZ (2003) A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4):202\u2013208","journal-title":"Networks"},{"issue":"2","key":"1474_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/35.900635","volume":"39","author":"AL Chiu","year":"2001","unstructured":"Chiu AL, Strand J, Tkach R (2001) Issues for routing in the optical layer. IEEE Commun Mag 39(2):81\u201387","journal-title":"IEEE Commun Mag"},{"issue":"7","key":"1474_CR7","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.jpdc.2005.12.010","volume":"66","author":"F Dai","year":"2006","unstructured":"Dai F, Wu J (2006) On constructing $$k$$-connected $$k$$-dominating set in wireless ad hoc and sensor networks. J Parallel Distrib Comput 66(7):947\u2013958","journal-title":"J Parallel Distrib Comput"},{"key":"1474_CR8","doi-asserted-by":"crossref","unstructured":"Du DZ, Wan PJ (2013) Connected dominating set: theory and applications. Springer, New York","DOI":"10.1007\/978-1-4614-5242-3"},{"key":"1474_CR9","unstructured":"Farag\u00f3 A (2006) A graph theoretic model for complex network failure scenarios. In: Proceedings of the Eighth INFORMS Telecommunications Conference. Dallas"},{"key":"1474_CR10","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"issue":"4","key":"1474_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374\u2013387","journal-title":"Algorithmica"},{"key":"1474_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"S Krumke","year":"1998","unstructured":"Krumke S, Wirth H (1998) On the minimum label spanning tree problem. Inf Process Lett 66:81\u201385","journal-title":"Inf Process Lett"},{"key":"1474_CR13","doi-asserted-by":"crossref","unstructured":"Majid M, Habib S, Javed AR, Rizwan M, Srivastava G, Gadekallu TR, Lin J (2022) Applications of wireless sensor networks and internet of things frameworks in the industry revolution 4.0: A systematic literature review. Sensors 22(6):2087","DOI":"10.3390\/s22062087"},{"issue":"6","key":"1474_CR14","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/s00453-022-00935-x","volume":"84","author":"Z Nutov","year":"2022","unstructured":"Nutov Z (2022) Approximating $$k$$-connected $$m$$-dominating sets. Algorithmica 84(6):1511\u20131525","journal-title":"Algorithmica"},{"key":"1474_CR15","unstructured":"Papadimitriou D, Poppe F, Jones J, Venkatachalam S, Dharanikota S, Jain R, Hartani R, Griffith D (2001) Inference of shared risk link groups. IETF Draft, OIF Contribution"},{"key":"1474_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan L, Du HW, Jia XH, Wu WL, Li YS, Ko KI (2004) A greedy approximation for minimum connected dominating sets. Theoret Comput Sci 329:325\u2013330","journal-title":"Theoret Comput Sci"},{"key":"1474_CR17","doi-asserted-by":"crossref","unstructured":"Sebos P, Yates J, Hjlmtsson G, Greenberg A (2001) Auto-discovery of shared risk link groups. In: Proceedings of IEEE\/OSA OFC 3: WDD3-1\u2013WDD3-3","DOI":"10.1109\/OFC.2001.928453"},{"issue":"2","key":"1474_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10878-007-9124-y","volume":"16","author":"W Shang","year":"2008","unstructured":"Shang W, Yao F, Wan P, Hu X (2008) On minimum $$m$$-connected $$k$$-dominating set problem in unit disc graphs. J Comb Optim 16(2):99\u2013106","journal-title":"J Comb Optim"},{"issue":"1","key":"1474_CR19","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s10878-014-9720-6","volume":"31","author":"YS Shi","year":"2016","unstructured":"Shi YS, Zhang YP, Zhang Z, Wu WL (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":"1474_CR20","doi-asserted-by":"crossref","unstructured":"Trigka M, Dritsas E (2025) Wireless sensor networks: from fundamentals and applications to innovations and future trends. IEEE Access","DOI":"10.1109\/ACCESS.2025.3572328"},{"key":"1474_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0020-0190(02)00230-2","volume":"84","author":"Y Wan","year":"2002","unstructured":"Wan Y, Chen G, Xu Y (2002) A note on the minimum label spanning tree. Inf Process Lett 84:99\u2013101","journal-title":"Inf Process Lett"},{"issue":"3","key":"1474_CR22","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"},{"issue":"5","key":"1474_CR23","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, Gao W, Li XY, Zhang Z, Wu WL (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"},{"key":"1474_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52824-9","volume-title":"Optimal coverage in wireless sensor networks","author":"W Wu","year":"2020","unstructured":"Wu W, Zhang Z, Lee W, Du DZ (2020) Optimal coverage in wireless sensor networks. Springer, Cham, Switzerland"},{"key":"1474_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.orl.2004.03.004","volume":"33","author":"Y Xiong","year":"2005","unstructured":"Xiong Y, Golden B, Wasil E (2005) Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem. Oper Res Lett 33:77\u201380","journal-title":"Oper Res Lett"},{"issue":"2","key":"1474_CR26","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s11590-020-01628-6","volume":"15","author":"ZS Yang","year":"2020","unstructured":"Yang ZS, Shi MJ, Wang W (2020) Greedy approximation for the minimum connected dominating set with labeling. Optim Lett 15(2):685\u2013700","journal-title":"Optim Lett"},{"key":"1474_CR27","first-page":"2658","volume":"4","author":"S Yuan","year":"2005","unstructured":"Yuan S, Varma S, Jue JP (2005) Minimum-color path problems for reliability in mesh networks. Proc IEEE INFOCOM 4:2658\u20132669","journal-title":"Proc IEEE INFOCOM"},{"issue":"2","key":"1474_CR28","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/ijoc.2017.0776","volume":"30","author":"Z Zhang","year":"2018","unstructured":"Zhang Z, Zhou J, Tang S, Huang X, Du DZ (2018) Computing minimum $$k$$-connected $$m$$-fold dominating set in general graphs. INFORMS J Comput 30(2):217\u2013224","journal-title":"INFORMS J Comput"},{"key":"1474_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114069","volume":"973","author":"H Zhong","year":"2023","unstructured":"Zhong H, Tang Y, Zhang Q, Lin R, Li W (2023) A unified greedy approximation for several dominating set problems. Theor Comput Sci 973:114069","journal-title":"Theor Comput Sci"},{"issue":"1","key":"1474_CR30","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s10878-013-9638-4","volume":"28","author":"J Zhou","year":"2014","unstructured":"Zhou J, Zhang Z, Wu WL, Xing K (2014) A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J Comb Optim 28(1):310\u2013319","journal-title":"J Comb Optim"},{"issue":"6","key":"1474_CR31","doi-asserted-by":"publisher","first-page":"3487","DOI":"10.1109\/TNET.2017.2740328","volume":"25","author":"J Zhou","year":"2017","unstructured":"Zhou J, Zhang Z, Tang S, Huang X, Mo Y, Du DZ (2017) Fault-tolerant virtual backbone in heterogeneous wireless sensor network. IEEE\/Acm Trans Netw 25(6):3487\u20133499","journal-title":"IEEE\/Acm Trans Netw"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01474-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01474-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01474-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T16:33:23Z","timestamp":1791822803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01474-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,23]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["1474"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01474-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,23]]},"assertion":[{"value":"1 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"No potential conflict of interest was reported by the authors.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"30"}}