{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:06:22Z","timestamp":1772042782213,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"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":["U20A2068"],"award-info":[{"award-number":["U20A2068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10878-023-00989-9","type":"journal-article","created":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T21:33:38Z","timestamp":1675287218000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Construction of minimum edge-fault tolerant connected dominating set in a general graph"],"prefix":"10.1007","volume":"45","author":[{"given":"Yaoyao","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,1]]},"reference":[{"issue":"4","key":"989_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"IF Akyildiz","year":"2002","unstructured":"Akyildiz IF, Su W, Sankarasubramaniam Y (2002) Wireless sensor networks: a survey. Comput Netw 38(4):393\u2013422","journal-title":"Comput Netw"},{"key":"989_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph Theory. Springer, New York"},{"key":"989_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106175","volume":"173","author":"A Belgi","year":"2022","unstructured":"Belgi A, Nutov Z (2022) A polylogarithmic approximation algorithm for 2-edge-connected dominating set. Inf Process Lett 173:106175","journal-title":"Inf Process Lett"},{"key":"989_CR4","doi-asserted-by":"crossref","unstructured":"Chen L, Kyng R, Liu YP, Peng R, Gutenberg MP, Sachdeva S (2022) Maximum flow and minimum-cost flow in almost-linear time. https:\/\/arxiv.org\/abs\/2203.00671","DOI":"10.1109\/FOCS54457.2022.00064"},{"issue":"7","key":"989_CR5","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":"989_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5242-3","volume-title":"Connected dominating set: theory and applications","author":"D-Z Du","year":"2013","unstructured":"Du D-Z, Wan P-J (2013) Connected dominating set: theory and applications. Springer, New York"},{"issue":"1","key":"989_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"issue":"1","key":"989_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/PROC.1987.13705","volume":"75","author":"A Ephremides","year":"1987","unstructured":"Ephremides A, Wieselthier JE, Baker DJ (1987) A design concept for reliable mobile radio networks with frequency hopping signaling. Proc IEEE 75(1):56\u201373","journal-title":"Proc IEEE"},{"issue":"8","key":"989_CR9","doi-asserted-by":"publisher","first-page":"7828","DOI":"10.1109\/TVT.2019.2925013","volume":"68","author":"X Fu","year":"2019","unstructured":"Fu X, Yao H, Yang Y (2019) Modeling cascading failures for wireless sensor networks with node and link capacity. IEEE Trans Veh Technol 68(8):7828\u20137840","journal-title":"IEEE Trans Veh Technol"},{"key":"989_CR10","first-page":"1","volume":"1","author":"T Fukunaga","year":"2015","unstructured":"Fukunaga T (2015) Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs. Algorithmica 1:1\u201323","journal-title":"Algorithmica"},{"issue":"4","key":"989_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":"989_CR12","first-page":"1","volume":"2010","author":"D Kim","year":"2010","unstructured":"Kim D, Wang W, Li X, Zhang Z, Wu W (2010) A new constant factor approximation for computing 3-connected $$m$$-dominating sets in homogeneous wireless networks. Proc IEEE INFOCOM 2010:1\u20139","journal-title":"Proc IEEE INFOCOM"},{"issue":"1","key":"989_CR13","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/TNET.2017.2780262","volume":"26","author":"B Liu","year":"2018","unstructured":"Liu B, Wang W, Kim D, Li Y, Kwon S-S, Jiang Y (2018) On practical construction of quality fault-tolerant virtual backbone in homogeneous wireless networks. IEEE\/ACM Trans Netw 26(1):412\u2013421","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"1","key":"989_CR14","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s10878-010-9346-2","volume":"23","author":"Y Li","year":"2012","unstructured":"Li Y, Wu Y, Ai C, Beyah R (2012) On the construction of $$k$$-connected $$m$$-dominating sets in wireless networks. J Comb Optim 23(1):118\u2013139","journal-title":"J Comb Optim"},{"key":"989_CR15","doi-asserted-by":"publisher","first-page":"5977781","DOI":"10.1155\/2021\/5977781","volume":"2021","author":"XY Liang","year":"2021","unstructured":"Liang XY, Liang JR, Zhang WG (2021) Construction of quality virtual backbones with link fault tolerance in wireless sensor networks. Wirel Commun Mob Comput 2021:5977781. https:\/\/doi.org\/10.1155\/2021\/5977781","journal-title":"Wirel Commun Mob Comput"},{"key":"989_CR16","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 Proces Lett 140:30\u201333","journal-title":"Inf Proces Lett"},{"key":"989_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2007.05.025","volume":"358","author":"MT Thai","year":"2007","unstructured":"Thai MT, Zhang N, Tiwari R, Xu X (2007) On approximation algorithms of $$k$$-connected $$m$$-dominating sets in disk graphs. Theor Comput Sci 358:49\u201359","journal-title":"Theor Comput Sci"},{"issue":"1","key":"989_CR18","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, Wu W (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"},{"issue":"2","key":"989_CR19","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TNET.2016.2607723","volume":"25","author":"Y Shi","year":"2016","unstructured":"Shi Y, Zhang Z, Mo Y, Du D-Z (2016) Approximation algorithm for minimum weight fault-tolerant virtual backbone in unit disk graphs. IEEE\/ACM Trans Netw 25(2):925\u2013933","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"989_CR20","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":"3","key":"989_CR21","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 D-Z (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":"989_CR22","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 X, Zhang Z, Wu W (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":"1","key":"989_CR23","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TNET.2016.2561901","volume":"25","author":"W Wang","year":"2016","unstructured":"Wang W, Liu B, Kim D, Li D, Wang J, Gao W (2016) A new constant factor approximation to construct highly fault-tolerant connected dominating set in unit disk graph. IEEE\/ACM Trans Netw 25(1):18\u201328","journal-title":"IEEE\/ACM Trans Netw"},{"key":"989_CR24","doi-asserted-by":"crossref","unstructured":"Wu W, Zhang Z, Lee W, Du D-Z (2020) Optimal coverage in wireless sensor networks. Springer, Cham, Switzerland","DOI":"10.1007\/978-3-030-52824-9"},{"issue":"4","key":"989_CR25","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1142\/S1793830909000361","volume":"1","author":"Z Zhang","year":"2009","unstructured":"Zhang Z, Liu Q, Li D (2009) Two algorithms for connected $$r$$-hop $$k$$-dominating set. Discret Math Algorithms Appl 1(4):485\u2013498","journal-title":"Discret Math Algorithms Appl"},{"issue":"2","key":"989_CR26","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 SJ, Huang XH, Du D-Z (2018) Computing minimum $$k$$-connected $$m$$-fold dominating set in general graphs. INFORMS J Comput 30(2):217\u2013224","journal-title":"INFORMS J Comput"},{"issue":"1","key":"989_CR27","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 W, 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":"989_CR28","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 D-Z (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-023-00989-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-00989-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-00989-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T22:38:36Z","timestamp":1675291116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-00989-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,1]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["989"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-00989-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,1]]},"assertion":[{"value":"10 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"63"}}