{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T15:17:28Z","timestamp":1680448648726},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,11]],"date-time":"2015-02-11T00:00:00Z","timestamp":1423612800000},"content-version":"tdm","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":[[2016,5]]},"DOI":"10.1007\/s10878-015-9838-1","type":"journal-article","created":{"date-parts":[[2015,2,10]],"date-time":"2015-02-10T12:36:34Z","timestamp":1423571794000},"page":"1505-1517","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An approximation algorithm for maximum weight budgeted connected set cover"],"prefix":"10.1007","volume":"31","author":[{"given":"Yingli","family":"Ran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ker-I","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,11]]},"reference":[{"key":"9838_CR1","unstructured":"Avrachenkov K, Basu P, Neglia G, Ribeiro BF, Towsley D (2014) Pay few, influence most: online myopic network covering, NetSciCom\u201914, INFOCOM WKSHPS, Toronto, ON, pp. 813\u2013818"},{"key":"9838_CR2","doi-asserted-by":"crossref","unstructured":"Bateni M, Hajiaghayi M, Liaghat V (2013) Improved approximation algorithms for (budgeted) node-weighted steiner problems. ICALP\u201913, LNCS 7965, pp. 81\u201392","DOI":"10.1007\/978-3-642-39206-1_8"},{"key":"9838_CR3","volume-title":"Design and analysis of approximation algorithms","author":"D-Z Du","year":"2011","unstructured":"Du D-Z, Ko K-I, Hu X (2011) Design and analysis of approximation algorithms. Springer, New York"},{"key":"9838_CR4","unstructured":"Guha S, Moss A, Naor J, Schieber B (1999) Efficient recovery from power outage, STOC\u201999, Atlanta, UAS, pp. 574\u2013582"},{"key":"9838_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor J (1999) The budgeted maximum coverage problem. Inf Process Lett 70:39\u201345","journal-title":"Inf Process Lett"},{"key":"9838_CR6","doi-asserted-by":"crossref","unstructured":"Khuller S, Purohit M, Sarpatwar KK (2014) Analyzing the optimal neighborhood: algorithms for the budgeted and partial connected dominating set prooblem. SODA\u201914, pp. 1702\u20131713","DOI":"10.1137\/1.9781611973402.123"},{"key":"9838_CR7","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1137\/S0097539702420474","volume":"37","author":"A Moss","year":"2007","unstructured":"Moss A, Rabani Y (2007) Approximation algorithms for constrained node weighted Steiner tree problems. SIAM J Comput 37:460\u2013481","journal-title":"SIAM J Comput"},{"key":"9838_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-I. Math Program 14:265\u2013294","journal-title":"Math Program"},{"key":"9838_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2005.08.037","volume":"352","author":"W Wu","year":"2006","unstructured":"Wu W, Du H, Jia X, Li Y, Huang S (2006) Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor Comput Sci 352:1\u20137","journal-title":"Theor Comput Sci"},{"key":"9838_CR10","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1016\/j.tcs.2008.11.005","volume":"410","author":"Z Zhang","year":"2009","unstructured":"Zhang Z, Gao X, Wu W (2009) Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theor Comput Sci 410:812\u2013817","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9838-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9838-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9838-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T20:27:32Z","timestamp":1566332852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9838-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,11]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9838"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9838-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,11]]}}}