{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:59:51Z","timestamp":1760597991543,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T00:00:00Z","timestamp":1598400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T00:00:00Z","timestamp":1598400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571015"],"award-info":[{"award-number":["11571015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["1907472"],"award-info":[{"award-number":["1907472"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10878-020-00638-5","type":"journal-article","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T20:02:46Z","timestamp":1598472166000},"page":"907-928","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Influence maximization problem: properties and algorithms"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yapu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,26]]},"reference":[{"key":"638_CR1","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: SODA, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"638_CR2","doi-asserted-by":"crossref","unstructured":"Chaoji V, Ranu S, Rastogi R, Bhatt R (2012) Recommendations to boost content spread in social networks. In: WWW, pp 529\u2013538","DOI":"10.1145\/2187836.2187908"},{"key":"638_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: KDD, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"638_CR4","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 (1977) Location of bank accounts to optimize float. Manag Sci 23:789\u2013810","journal-title":"Manag Sci"},{"key":"638_CR5","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Seventh international conference on knowledge discovery and data mining","DOI":"10.1145\/502512.502525"},{"key":"638_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032916","volume-title":"Theory of computational complexity","author":"D-Z Du","year":"2000","unstructured":"Du D-Z, Ko K-I (2000) Theory of computational complexity. Wiley, New York"},{"key":"638_CR7","unstructured":"Du D-Z, Ko K-I, Hu X (2008) Design and analysis of approximation algorithms. Lecture notes"},{"key":"638_CR8","unstructured":"Du D-Z, Graham RL, Pardalos PM, Wan P-J, Wu W, Zhao W (2008) Analysis of greedy approximations with non-submodular potential functions. In: Proceedings of the 19th annual ACM-SIAM symposium on dicrete algorithms (SODA), San Francisco, USA, Jan 20\u201322, pp 167\u2013175"},{"key":"638_CR9","doi-asserted-by":"crossref","unstructured":"Feige U, Izsak R (2013) Welfare maximization and the supermodular degree. In: Proceedings of the 4th conference on innovations in theoretical computer science, pp 247\u2013256","DOI":"10.1145\/2422436.2422466"},{"key":"638_CR10","unstructured":"Feldman M, Izsak R (2014) Constrained monotone function maximization and the supermodular degree. Eprint Arxiv"},{"key":"638_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12:211\u2013223","journal-title":"Mark Lett"},{"key":"638_CR12","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83:1420\u20131443","journal-title":"Am J Sociol"},{"key":"638_CR13","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of influence through a social network. In: KDD, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"2","key":"638_CR14","first-page":"60","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu W, Chen W, Lakshmanan LV (2015) From competition to complementarity: comparative influence diffusion and maximization. VLDB 9(2):60\u201371","journal-title":"VLDB"},{"key":"638_CR15","doi-asserted-by":"crossref","unstructured":"Murota K (2003) Discrete convex analysis. In: SIMA of discrete mathematics and applications","DOI":"10.1137\/1.9780898718508"},{"key":"638_CR16","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 (1978) An analysis of the approximations for maximizing submodular set functions. Math Program 14:265\u2013294","journal-title":"Math Program"},{"key":"638_CR17","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: SIGMOD, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"key":"638_CR18","doi-asserted-by":"crossref","unstructured":"Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi K (2014) Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations. In: AAAI, pp 138\u2013144","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"638_CR19","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Eighth international conference on knowledge discovery and data mining","DOI":"10.1145\/775047.775057"},{"key":"638_CR20","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"638_CR21","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: SIGMOD, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"issue":"11","key":"638_CR22","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1109\/TKDE.2017.2740284","volume":"29","author":"Z Wang","year":"2017","unstructured":"Wang Z, Yang Y, Pei J, Chu L, Chen E (2017) Activity maximization by effective information diffusion in social networks. IEEE Trans Knowl Data Eng 29(11):2374\u20132387","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"638_CR23","doi-asserted-by":"crossref","unstructured":"Zhang H, Dinh TN, Thai MT (2013) Maximizing the spread of positive influence in online social networks. In: IEEE 33rd international conference on distributed computing systems, pp 317\u2013326","DOI":"10.1109\/ICDCS.2013.37"},{"key":"638_CR24","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s10898-009-9511-2","volume":"48","author":"X Zhu","year":"2010","unstructured":"Zhu X, Jieun Y, Lee W, Kim D, Shan S, Ding-Zhu D (2010) New dominating sets in social networks. J Glob Optim 48:633\u2013642","journal-title":"J Glob Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00638-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00638-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00638-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T04:10:41Z","timestamp":1668053441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00638-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,26]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["638"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00638-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,8,26]]},"assertion":[{"value":"26 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}