{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:57:37Z","timestamp":1773392257754,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T00:00:00Z","timestamp":1529020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11671400"],"award-info":[{"award-number":["11671400"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s11280-018-0607-9","type":"journal-article","created":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T23:15:35Z","timestamp":1529018135000},"page":"2977-2996","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Minimum cost seed set for threshold influence problem under competitive models"],"prefix":"10.1007","volume":"22","author":[{"given":"Ruidong","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zilong","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,15]]},"reference":[{"key":"607_CR1","doi-asserted-by":"crossref","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks[J]. Internet and Network Economics, pp. 306\u2013311 (2007)","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"607_CR2","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on World Wide Web, pp. 665\u2013674. ACM (2011)","DOI":"10.1145\/1963405.1963499"},{"issue":"8","key":"607_CR3","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M., Nemhauser, G.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms[J]. Manag. Sci. 23(8), 789\u2013810 (1977)","journal-title":"Manag. Sci."},{"key":"607_CR4","first-page":"1","volume":"18","author":"N Du","year":"2017","unstructured":"Du, N., Liang, Y., Balcan, M., Manuel, G., Zha, H., Song, L: Scalable influence maximization for multiple products in continuous-time diffusion networks. J. Mach. Learn. Res. 18, 1\u201345 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"607_CR5","doi-asserted-by":"crossref","unstructured":"Fan, L., Lu, Z., Wu, W., Thuraisingham, B., Ma, H., Bi, Y.: Least cost rumor blocking in social networks. In: 33rd international conference on distributed computing systems (2013)","DOI":"10.1109\/ICDCS.2013.34"},{"key":"607_CR6","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.physa.2014.02.032","volume":"403","author":"S Gao","year":"2014","unstructured":"Gao, S., Ma, J., Chen, Z., Wang, G., Xing, C.: Ranking the spreading ability of nodes in complex networks based on local structure[J]. Physica A: Statistical Mechanics and its Applications 403, 130\u2013147 (2014)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"2","key":"607_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s13278-012-0062-z","volume":"3","author":"A Goyal","year":"2013","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.S., Venkatasubramanian, S.: On minimizing budget and time in influence propagation over social networks. Soc. Netw. Anal. Min. 3(2), 179\u2013192 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"4","key":"607_CR8","doi-asserted-by":"publisher","first-page":"e3054","DOI":"10.1002\/ett.3054","volume":"28","author":"Meng Han","year":"2016","unstructured":"Han, M., Yan, M., Cai, Z., Li, Y., Cai, X., Yu, J.: Influence maximization by probing partial communities in dynamic online social networks[J]. Transactions on Emerging Telecommunications Technologies 28(4) (2017)","journal-title":"Transactions on Emerging Telecommunications Technologies"},{"key":"607_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Thatcher, R.E., Miller, J.W. (eds.) Complexity of computer computations, pp 85\u2013103. Plenum, New York (1972)"},{"key":"607_CR10","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. KDD\u201903, pp. 137\u2013146 (2003)","DOI":"10.1145\/956755.956769"},{"key":"607_CR11","doi-asserted-by":"crossref","unstructured":"Kuhnle, A., Pan, T., Alim, M., Thai, T.: Scalable bicriteria algorithms for the threshold activation problem in online social networks. In: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, pp. 1\u20139. Atlanta (2017)","DOI":"10.1109\/INFOCOM.2017.8057068"},{"key":"607_CR12","doi-asserted-by":"publisher","first-page":"8665","DOI":"10.1038\/srep08665","volume":"5","author":"G Lawyer","year":"2015","unstructured":"Lawyer, G.: Understanding the influence of all nodes in a network[J]. Sci. Rep. 5, 8665 (2015)","journal-title":"Sci. Rep."},{"key":"607_CR13","unstructured":"Li, S., Zhu, Y., Li, D., Kim, D., Huang, H.: Rumor restriction in online social networks. In: Performance computing and communications conference (IPCCC), 2013 IEEE 32nd International. IEEE, pp. 1\u201310 (2013)"},{"key":"607_CR14","doi-asserted-by":"crossref","unstructured":"Long, C., Wong, R.C.: Minimizing seed set for viral marketing. In: Proceedings of the 2011 IEEE 11th international conference on data mining, ICDM 11, pp. 427\u2013436 (2011)","DOI":"10.1109\/ICDM.2011.99"},{"key":"607_CR15","doi-asserted-by":"crossref","unstructured":"Lu, W., Bonchi, F., Goyal, A., Lakshmanan, L.V.S.: The bang for the buck: Fair competitive viral marketing from the host perspective. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD \u201913), pp. 928\u2013936","DOI":"10.1145\/2487575.2487649"},{"key":"607_CR16","doi-asserted-by":"crossref","unstructured":"Myers, S.A., Zhu, C., Leskovec, J.: Information diffusion and external influence in networks. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 33\u201341. ACM (2012)","DOI":"10.1145\/2339530.2339540"},{"key":"607_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of the approximations for maximizing submodular set functions. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"607_CR18","unstructured":"Page, L., Brin, S., Motwani, R, Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Stanford InfoLab (1999)"},{"issue":"1","key":"607_CR19","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2017","unstructured":"Tong, G., Wu, W., Tang, S., Du, D.: Adaptive influence maximization in dynamic social networks[J]. IEEE\/ACM Trans. Networking (TON) 25(1), 112\u2013125 (2017)","journal-title":"IEEE\/ACM Trans. Networking (TON)"},{"key":"607_CR20","doi-asserted-by":"crossref","unstructured":"Tong, G., Wu, W., Guo, L., Li, D., Liu, C., Liu, B., Du, D.: An efficient randomized algorithm for rumor blocking in online social networks. In: IEEE international conference on computer communications (2016)","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"607_CR21","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-319-55753-3_39","volume-title":"Database Systems for Advanced Applications","author":"Qian Yan","year":"2017","unstructured":"Yan, Q., Huang, H., Gao, Y., Lu, W., He, Q.: Group-level influence maximization with budget constraint. In: Database systems for advanced applications (DASFAA), Part I, LNCS, 10177, pp. 625\u2013641 (2017)"},{"key":"607_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, P., Chen, W., Sun, X., Wang, Y., Zhang, J.: Minimizing seed set selection with probabilistic coverage guarantee in a social network. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD14), pp. 1306\u20131315 (2014)","DOI":"10.1145\/2623330.2623684"},{"key":"607_CR23","doi-asserted-by":"crossref","unstructured":"Zhu, Y.D.L., Zhang, Z.: Minimum cost seed set for competitive social influence. In: IEEE INFOCOM 2016-The 35th annual IEEE international conference on computer communications, pp. 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524472"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0607-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-018-0607-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0607-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:00:29Z","timestamp":1751688029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-018-0607-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,15]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["607"],"URL":"https:\/\/doi.org\/10.1007\/s11280-018-0607-9","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,15]]},"assertion":[{"value":"1 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}