{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:38Z","timestamp":1759637978233,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,17]],"date-time":"2016-08-17T00:00:00Z","timestamp":1471392000000},"content-version":"unspecified","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":["11201439","11271341"],"award-info":[{"award-number":["11201439","11271341"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["201513013"],"award-info":[{"award-number":["201513013"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0067-z","type":"journal-article","created":{"date-parts":[[2016,8,17]],"date-time":"2016-08-17T04:17:55Z","timestamp":1471407475000},"page":"314-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Centralized and decentralized rumor blocking problems"],"prefix":"10.1007","volume":"34","author":[{"given":"Xin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0895-7793","authenticated-orcid":false,"given":"Qingqin","family":"Nong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongchang","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suning","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ker-I","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,17]]},"reference":[{"key":"67_CR1","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal C, El Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on World wide web. ACM, pp. 665\u2013674","DOI":"10.1145\/1963405.1963499"},{"key":"67_CR2","unstructured":"Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process. \n                        arXiv:1204.3074"},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Fan L, Lu Z, Wu W, Thuraisingham B, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: Proceedings IEEE 33rd international conference on distributed computing systems (ICDCS), pp 540\u2013549","DOI":"10.1109\/ICDCS.2013.34"},{"issue":"01","key":"67_CR5","doi-asserted-by":"crossref","first-page":"1650004","DOI":"10.1142\/S179383091650004X","volume":"8","author":"L Fan","year":"2016","unstructured":"Fan L, Wu W, Xing K et al (2016) Precautionary rumor containment via trustworthy people in social networks. Discret Math Algorithm Appl 8(01):1650004","journal-title":"Discret Math Algorithm Appl"},{"issue":"1","key":"67_CR6","first-page":"1","volume":"4","author":"L Fan","year":"2014","unstructured":"Fan L, Wu W, Zhai X et al (2014) Maximizing rumor containment in social networks with constrained time. Soc Netw Anal Min 4(1):1\u201310","journal-title":"Soc Netw Anal Min"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"He X, Song G, Chen W et al (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: SDM, pp 463\u2013474","DOI":"10.1137\/1.9781611972825.40"},{"key":"67_CR8","volume-title":"Influential nodes in a diffusion model for social networks. International colloquium on automata, languages, and programming","author":"D Kempe","year":"2005","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2005) Influential nodes in a diffusion model for social networks. International colloquium on automata, languages, and programming. Springer, Berlin"},{"key":"67_CR9","unstructured":"Kempe D, Kleinberg J (2003) \u00c9 Tardos. Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 137\u2013146"},{"key":"67_CR10","unstructured":"Kotnis B, Kuri J (2014) Cost effective rumor containment in social networks. \n                        arXiv:1403.6315"},{"key":"67_CR11","doi-asserted-by":"crossref","unstructured":"Li S, Zhu Y, Li D, Kim D, Huang H (2013) Rumor restriction in online social networks. In: Proceedings 2013 IEEE 32nd international performance computing and communications conference (IPCCC). pp 1\u201310","DOI":"10.1109\/PCCC.2013.6742780"},{"issue":"1","key":"67_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"LG Nemhauser","year":"1978","unstructured":"Nemhauser LG, Wolsey AL, Fisher LM (1978) An analysis of approximations for maximizing submodular set functional. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"67_CR13","doi-asserted-by":"crossref","unstructured":"Vetta A (2002) Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings 43rd annual IEEE symposium on foundations of computer science. pp 416\u2013425","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0067-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0067-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0067-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0067-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T03:29:29Z","timestamp":1589686169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0067-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,17]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0067-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,8,17]]}}}