{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:25:39Z","timestamp":1783787139799,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,5]],"date-time":"2016-03-05T00:00:00Z","timestamp":1457136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531011"],"award-info":[{"award-number":["11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370216"],"award-info":[{"award-number":["61370216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Xingjiang Talent Youth Project","award":["2013711011"],"award-info":[{"award-number":["2013711011"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-016-0005-0","type":"journal-article","created":{"date-parts":[[2016,3,4]],"date-time":"2016-03-04T23:08:31Z","timestamp":1457132911000},"page":"791-802","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Approximation algorithm for partial positive influence problem in social network"],"prefix":"10.1007","volume":"33","author":[{"given":"Yingli","family":"Ran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuqing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,3,5]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W Aiello","year":"2001","unstructured":"Aiello W, Chung F, Lu L (2001) A random graph model for powerlaw graphs. Exp Math 10:53\u201356","journal-title":"Exp Math"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barabasi A (2000) Error and attack tolerance of complex networks. Nature 406:378\u2013382","journal-title":"Nature"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset A, Shalizi C, Newman M (2009) Power-law distributions in empirical data. SIAM Rev 51:661\u2013703","journal-title":"SIAM Rev"},{"key":"5_CR4","first-page":"93","volume":"4","author":"JN Cohen","year":"2012","unstructured":"Cohen JN (2012) Professional resource: the potential of Google+ as a media literacy tool. J Media Lit Educ 4:93\u201396","journal-title":"J Media Lit Educ"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10878-012-9530-7","volume":"27","author":"TN Dinh","year":"2014","unstructured":"Dinh TN, Shen Y, Nguyen DT, Thai MT (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27:487\u2013503","journal-title":"J Comb Optim"},{"issue":"4","key":"5_CR6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/moor.7.4.515","volume":"7","author":"G Dobson","year":"1982","unstructured":"Dobson G (1982) Worst-case analysis of greedy heuristics for integer programming with non-negative data. Math Oper Res 7(4):515\u2013531","journal-title":"Math Oper Res"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1137\/0603059","volume":"3","author":"ML Fisher","year":"1982","unstructured":"Fisher ML, Wolsey LA (1982) On the greedy heuristic for continuous covering and packing problems. SIAM J Algebraic Discret Methods 3:584\u2013591","journal-title":"SIAM J Algebraic Discret Methods"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Kleinberg J (2000) The small-world phenomenon: an algorithmic perspective. In: 32nd STOC, pp 163-170","DOI":"10.1145\/335305.335325"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0166-218X(02)00598-X","volume":"129","author":"SG Kolliopoulos","year":"2003","unstructured":"Kolliopoulos SG (2003) Approximating covering integer programs with multiplicity constraints. Discrete Appl Math 129:461\u2013473","journal-title":"Discrete Appl Math"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.jcss.2005.05.002","volume":"71","author":"SG Kolliopoulos","year":"2005","unstructured":"Kolliopoulos SG, Young Neal E (2005) Approximation algorithms for covering\/packing. J Comput Syst Sci 71:495\u2013505","journal-title":"J Comput Syst Sci"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Raei H, Yazdani N, Asadpour M (2012) A new algorithm for positive influence dominating set in social networks. In: IEEE\/ACM International conference on advances in social networks analysis and mining, pp 253\u2013257","DOI":"10.1109\/ASONAM.2012.51"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Rajagopalan S, Vazirani VV (1993) Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs. In: Proceedings of the 34th annual IEEE symposium on foundations of computer science, pp 322\u2013331","DOI":"10.1109\/SFCS.1993.366855"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.disopt.2011.05.004","volume":"4","author":"D Rawitz","year":"2011","unstructured":"Rawitz D, Shahar SH (2011) Partial multicovering and the d-consecutive ones property. Discret Optim 4:555\u2013567","journal-title":"Discret Optim"},{"key":"5_CR14","unstructured":"Srinivasan A (1996) An extension of the Lov\u00e1sz local lemma and its applications to integer programming. In: Proceedings of the seventh ACM-SIAM symposium on discrete algorithms, pp 6\u201315"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1137\/S0097539796314240","volume":"29","author":"A Srinivasan","year":"1999","unstructured":"Srinivasan A (1999) Improved approximations guarantees for packing and covering integer programs. SIAM J Comput 29:648\u2013670 (preliminary version in Proc. STOC 95)","journal-title":"SIAM J Comput"},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1137\/S0097539798335596","volume":"30","author":"A Srinivasan","year":"2001","unstructured":"Srinivasan A, Teo C-P (2001) A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. SIAM J Comput 30:2051\u20132068 (preliminary version in Proc. STOC 97)","journal-title":"SIAM J Comput"},{"key":"5_CR17","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"},{"key":"5_CR18","series-title":"LNCS","first-page":"313","volume-title":"COCOA2009","author":"F Wang","year":"2009","unstructured":"Wang F, Camacho E, Xu K (2009) Positive influence dominating set in online social networks. COCOA2009., LNCSSpringer, Berlin, pp 313\u2013321"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.tcs.2009.10.001","volume":"412","author":"F Wang","year":"2011","unstructured":"Wang F, Du H, Camacho E, Xu K, Lee W, Shi Y, Shan S (2011) On positive influence dominating sets in social networks. Theor Comput Sci 412:265\u2013269","journal-title":"Theor Comput Sci"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s13278-011-0033-9","volume":"2","author":"W Zhang","year":"2012","unstructured":"Zhang W, Wu W, Wang F, Xu K (2012a) Positive influence dominating sets in power-law graphs. Soc Netw Anal Min 2:31\u201337","journal-title":"Soc Netw Anal Min"},{"key":"5_CR21","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10878-010-9359-x","volume":"23","author":"W Zhang","year":"2012","unstructured":"Zhang W, Zhang Z, Wang W, Zou F, Lee W (2012b) Polynomial time approximation scheme for $$t$$ t -latency bounded information propagation problem in wireless networks. J Combin Optim 23:451\u2013461","journal-title":"J Combin Optim"},{"issue":"1","key":"5_CR22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1142\/S1793830910000528","volume":"2","author":"F Zou","year":"2010","unstructured":"Zou F, Willson JK, Zhang Z, Wu W (2010) Fast Information propagation in social networks. Discret Math Algorithms Appl 2(1):125\u2013141","journal-title":"Discret Math Algorithms Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0005-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0005-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0005-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0005-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T03:38:44Z","timestamp":1567654724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0005-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,5]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["5"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0005-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,5]]}}}