{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:40:45Z","timestamp":1773895245847,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T00:00:00Z","timestamp":1595894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T00:00:00Z","timestamp":1595894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11571015"],"award-info":[{"award-number":["11571015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11991022"],"award-info":[{"award-number":["11991022"]}],"id":[{"id":"10.13039\/501100001809","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":[[2020,10]]},"DOI":"10.1007\/s10878-020-00629-6","type":"journal-article","created":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T18:11:15Z","timestamp":1595959875000},"page":"825-847","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Boosting node activity by recommendations in social networks"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"first","affiliation":[]},{"given":"Shengminjie","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Ruidong","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"issue":"1","key":"629_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10458-014-9254-4","volume":"29","author":"E Anshelevich","year":"2013","unstructured":"Anshelevich E, Hate A, Magdon-Ismail M (2013) Seeding influential nodes in non-submodular models of information diffusion. Autonom Agents Multi Agent Syst 29(1):131\u2013159","journal-title":"Autonom Agents Multi Agent Syst"},{"key":"629_CR2","volume-title":"Competitive influence maximization in social networks. Internet and network economics","author":"S Bharathi","year":"2007","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. Internet and network economics. Springer, Berlin"},{"key":"629_CR3","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes JT, Lucier B (2014) Maximizing social influence in nearly optimal time. SODA 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"629_CR4","doi-asserted-by":"crossref","unstructured":"Chaoji V, Ranu S, Rastogi R et al (2012) Recommendations to boost content spread in social networks. ACM","DOI":"10.1145\/2187836.2187908"},{"key":"629_CR5","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, Washington, DC, USA, July 25-28, 2010. ACM","DOI":"10.1145\/1835804.1835934"},{"key":"629_CR6","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: kdd. Proc of Acm Kdd, 199-208, 199-208","DOI":"10.1145\/1557019.1557047"},{"key":"629_CR7","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the Network Value of Customers. In: ACM SIGKDD international conference on knowledge discovery and data mining. ACM","DOI":"10.1145\/502512.502525"},{"key":"629_CR8","doi-asserted-by":"crossref","unstructured":"Hannon J, Bennett M, Smyth B (2010) Recommending twitter users to follow using content and collaborative filtering approaches. In NIPS*17, 199-206","DOI":"10.1145\/1864708.1864746"},{"key":"629_CR9","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J (2003) Maximizing the spread of influence through a social network. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2003:137-146","DOI":"10.1145\/956750.956769"},{"key":"629_CR10","unstructured":"Kim J, Kim S.-K, Yu H (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE Computer Society"},{"key":"629_CR11","unstructured":"Leskovec Jure, Krevl Andrej (2014) SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data"},{"key":"629_CR12","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. KDD 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"629_CR13","unstructured":"Li CT, Lin YJ, Yeh MY (2017) Forecasting participants of information diffusion on social networks with its applications. Information Sciences, S0020025516308453"},{"key":"629_CR14","doi-asserted-by":"crossref","unstructured":"Lin, Y, Chen, W, Lui, JCS (2017) Boosting Information Spread: An Algorithmic Approach. In: 2017 IEEE 33rd international conference on data engineering (ICDE). IEEE","DOI":"10.1109\/ICDE.2017.137"},{"key":"629_CR15","doi-asserted-by":"crossref","unstructured":"Lin Y, Chen W, Lui JCS (2017) Boosting Information Spread: An Algorithmic Approach. In: IEEE International Conference on Data Engineering. IEEE","DOI":"10.1109\/ICDE.2017.137"},{"key":"629_CR16","doi-asserted-by":"crossref","unstructured":"Lu W, Chen W, Lakshmanan LVS (2015) From competition to complementarity: comparative influence diffusion and maximization","DOI":"10.14778\/2850578.2850581"},{"key":"629_CR17","doi-asserted-by":"crossref","unstructured":"Ma L, Cao G, Kaplan L (2017) Graphical approach for influence maximization in social networks under generic threshold-based non-submodular model. In: 2017 IEEE International conference on big data (Big Data), pp 970\u2013975","DOI":"10.1109\/BigData.2017.8258017"},{"issue":"7563","key":"629_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","volume":"524","author":"F Morone","year":"2015","unstructured":"Morone F, Makse HA (2015) Influence maximization in complex networks through optimal percolation. Nature 524(7563):65\u201368","journal-title":"Nature"},{"issue":"1","key":"629_CR19","first-page":"1","volume":"5","author":"B Nettasinghe","year":"2018","unstructured":"Nettasinghe B, Krishnamurthy V (2018) Influence maximization over markovian graphs: a stochastic optimization approach. IEEE Trans Signal Inf Process Over Netw 5(1):1\u201314","journal-title":"IEEE Trans Signal Inf Process Over Netw"},{"key":"629_CR20","unstructured":"Pham CV, Duong HV, Bui BQ, et al (2013) Maximizing Acceptance Probability for Active Friending in Online Social Networks. ACM"},{"key":"629_CR21","doi-asserted-by":"crossref","unstructured":"Premm Raj H, Narahari Y (2012) Influence limitation in multi-campaign social networks: A Shapley value based approach. In: IEEE international conference on automation science & engineering. IEEE","DOI":"10.1109\/CoASE.2012.6386448"},{"issue":"C","key":"629_CR22","first-page":"338","volume":"354","author":"He Qiang","year":"2019","unstructured":"Qiang He, Xingwei Wang, Zhencheng Lei, Min Huang, Yuliang Cai, Lianbo Ma (2019) TIFIM: a two-stage iterative framework for influence maximization in social networks. Appl Math Comput 354(C):338\u2013352","journal-title":"Appl Math Comput"},{"key":"629_CR23","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining Knowledge-Sharing Sites for Viral Marketing. Proc Sigkdd","DOI":"10.1145\/775047.775057"},{"key":"629_CR24","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.neucom.2019.02.010","volume":"338","author":"QH Shi","year":"2019","unstructured":"Shi QH, Wang C, Chen J et al (2019) Post and repost: a holistic view of budgeted influence maximization. Neurocomputing 338:92\u2013100","journal-title":"Neurocomputing"},{"key":"629_CR25","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: ACM SIGMOD international conference on management of data. ACM","DOI":"10.1145\/2588555.2593670"},{"key":"629_CR26","doi-asserted-by":"crossref","unstructured":"Tong H, Prakash BA, Eliassi-Rad T, Faloutsos M, Faloutsos C (2012) Gelling, and melting, large graphs by edge manipulation. In: Proceedings of the 21st ACM international conference on Information and knowledge management. ACM","DOI":"10.1145\/2396761.2396795"},{"issue":"3","key":"629_CR27","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Discov 25(3):545\u2013576","journal-title":"Data Min Knowl Discov"},{"issue":"99","key":"629_CR28","first-page":"1","volume":"PP","author":"Z Wang","year":"2016","unstructured":"Wang Z, Yang Y, Pei J et al (2016) Activity maximization by effective information diffusion in social networks. IEEE Trans Knowl Data Eng PP(99):1\u20131","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"629_CR29","doi-asserted-by":"crossref","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Acm Sigkdd International Conference on Knowledge Discovery & Data Mining. ACM","DOI":"10.1145\/1835804.1835935"},{"key":"629_CR30","doi-asserted-by":"crossref","unstructured":"Yang D-N, Hung H-J, Lee W-C, Chen W (2013) Maximizing Acceptance Probability for Active Friending in Online Social Networks. ACM","DOI":"10.1145\/2487575.2487599"},{"issue":"1","key":"629_CR31","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TCSS.2019.2891582","volume":"6","author":"W Yang","year":"2019","unstructured":"Yang W, Yuan J, Wu W et al (2019) Maximizing activity profit in social networks. IEEE Trans Comput Soc Syst 6(1):117\u2013126","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"3","key":"629_CR32","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1109\/TCSS.2019.2911865","volume":"6","author":"W Yang","year":"2019","unstructured":"Yang W, Ma J, Li Y et al (2019) Marginal gains to maximize content spread in social networks. IEEE Trans Comput Soc Syst 6(3):479\u2013490","journal-title":"IEEE Trans Comput Soc Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00629-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00629-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00629-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T23:36:18Z","timestamp":1627428978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00629-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,28]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["629"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00629-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,28]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}