{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:54:20Z","timestamp":1759179260825},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T00:00:00Z","timestamp":1502496000000},"content-version":"unspecified","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":[[2018,1]]},"DOI":"10.1007\/s10878-017-0165-6","type":"journal-article","created":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T06:13:19Z","timestamp":1502518399000},"page":"209-215","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On general threshold and general cascade models of social influence"],"prefix":"10.1007","volume":"35","author":[{"given":"Weili","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huijuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,12]]},"reference":[{"key":"165_CR1","doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. WINE, 306\u2013311","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"165_CR2","volume-title":"Desin and analysis of approximation algorithms","author":"Du Ding-Zhu","year":"2012","unstructured":"Ding-Zhu Du, Ko Ker-I, Hu Xiaodong (2012) Desin and analysis of approximation algorithms. Springer, Berlin"},{"key":"165_CR3","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of influence through a social network. KDD, 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"165_CR4","unstructured":"Lu Zaixin, Zhang Wei, Wu Weili, Fu Bin, Du Ding-Zhu (2011) Approximation and inapproximation for the influence maximization problem in social networks under deterministic linear threshold model. In: ICDCS workshops, pp. 160\u2013165"},{"key":"165_CR5","doi-asserted-by":"crossref","unstructured":"Mossel E, Roch S (2007) On the submodularity of influence in social networks. STOC, 128\u2013134","DOI":"10.1145\/1250790.1250811"},{"issue":"1","key":"165_CR6","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. Math Progr 14(1):265\u2013294","journal-title":"Math Progr"},{"issue":"4","key":"165_CR7","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1007\/s10878-016-9991-1","volume":"31","author":"Ailian Wang","year":"2016","unstructured":"Wang Ailian, Weili Wu, Cui Lei (2016) On Bharathi\u2013Kempe\u2013Salek conjecture on influence maximization in arborescence. J Comb Optim 31(4):1678\u20131684","journal-title":"J Comb Optim"},{"issue":"2","key":"165_CR8","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s10878-016-0006-z","volume":"33","author":"Lu Zaixin","year":"2017","unstructured":"Zaixin Lu, Zhang Zhao, Weili Wu (2017) Solution of Bharathi\u2013Kempe\u2013Salek conjecture on influence maximization in arborescence. J Comb Optim 33(2):803\u2013808","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0165-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0165-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0165-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T10:35:10Z","timestamp":1515407710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0165-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,12]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["165"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0165-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,12]]}}}