{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T10:57:39Z","timestamp":1782385059778,"version":"3.54.5"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T00:00:00Z","timestamp":1605139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T00:00:00Z","timestamp":1605139200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10878-020-00668-z","type":"journal-article","created":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T04:51:20Z","timestamp":1605156680000},"page":"118-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A greedy algorithm for the fault-tolerant outer-connected dominating set problem"],"prefix":"10.1007","volume":"41","author":[{"given":"Xiaozhi","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xianyue","family":"Li","sequence":"additional","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"}]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suogang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,12]]},"reference":[{"key":"668_CR1","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"2001","unstructured":"Aho AV, Hopcroft JE, Ullman JD (2001) The design and analysis of computer algorithms. Addison-Wesley, Reading"},{"key":"668_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s10878-011-9427-x","volume":"26","author":"MH Akhbari","year":"2013","unstructured":"Akhbari MH, Hasni R, Favaron O, Karami H, Sheikholeslami SM (2013) On the outer-connected domination in graphs. J Comb Optim 26:10\u201318","journal-title":"J Comb Optim"},{"key":"668_CR3","first-page":"35","volume":"38","author":"J Cyman","year":"2007","unstructured":"Cyman J (2007) The outer-connected domination number of a graph. Aust J Comb 38:35\u201346","journal-title":"Aust J Comb"},{"issue":"7","key":"668_CR4","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":"668_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1701-9","volume-title":"Design and analysis of approximation algorithms","author":"DZ Du","year":"2012","unstructured":"Du DZ, Ko KI, Hu XD (2012) Design and analysis of approximation algorithms. Springer, New York"},{"key":"668_CR6","first-page":"265","volume":"81","author":"H Jiang","year":"2010","unstructured":"Jiang H, Shan E (2010) Outer-connected domination in graphs. Util Math 81:265\u2013274","journal-title":"Util Math"},{"key":"668_CR7","volume-title":"Domination in graphs","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (eds) (1998a) Domination in graphs. Marcel Dekker Inc, New York"},{"key":"668_CR8","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998b) Fundamentals of domination in graphs. Marcel Dekker Inc, New York"},{"key":"668_CR9","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ipl.2013.05.001","volume":"113","author":"JM Keil","year":"2013","unstructured":"Keil JM, Pradhan D (2013) Computing a minimum outer-connected dominating set for the class of chordal graphs. Inf Process Lett 113:552\u2013561","journal-title":"Inf Process Lett"},{"key":"668_CR10","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.ipl.2015.07.008","volume":"115","author":"CJ Lin","year":"2015","unstructured":"Lin CJ, Liu JJ, Wang YL (2015) Finding outer-connected dominating sets in interval graphs. Inf Process Lett 115:917\u2013922","journal-title":"Inf Process Lett"},{"key":"668_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-04657-0_16","volume":"8344","author":"BS Panda","year":"2014","unstructured":"Panda BS, Pandey A (2014) Algorithm and hardness results for outer-connected dominating set in graphs. Lect Notes Comput Sci 8344:151\u2013162","journal-title":"Lect Notes Comput Sci"},{"key":"668_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-013-9703-z","volume":"31","author":"D Pradhan","year":"2016","unstructured":"Pradhan D (2016) On the complexity of the minimum outer-connected dominating set problem in graphs. J Comb Optim 31:1\u201312","journal-title":"J Comb Optim"},{"issue":"1","key":"668_CR13","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"},{"issue":"2","key":"668_CR14","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 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":"668_CR15","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, Xin K (2014) A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J Comb Optim 28:310\u2013319","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00668-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00668-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00668-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,24]],"date-time":"2021-01-24T03:11:59Z","timestamp":1611457919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00668-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["668"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00668-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,12]]},"assertion":[{"value":"1 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}