{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T03:00:58Z","timestamp":1771038058749,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319320489","type":"print"},{"value":"9783319320496","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32049-6_4","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T08:47:36Z","timestamp":1458809256000},"page":"49-64","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Influence Maximization in Weighted Independent Cascade Model"],"prefix":"10.1007","author":[{"given":"Yaxuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"issue":"18","key":"4_CR1","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825\u20133833 (2012)","journal-title":"Comput. Netw."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD, pp. 1029\u20131038. ACM (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: ACM SIGKDD, pp. 199\u2013208. ACM (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57\u201366. ACM (2001)","DOI":"10.1145\/502512.502525"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: WWW, pp. 47\u201348. ACM (2011)","DOI":"10.1145\/1963192.1963217"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/261342.571216","volume":"28","author":"DS Hochba","year":"1997","unstructured":"Hochba, D.S.: Approximation algorithms for NP-hard problems. ACM SIGACT News 28(2), 40\u201352 (1997)","journal-title":"ACM SIGACT News"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Cai, J.L.Z., Yan, M., Li, Y.: Using crowdsourced data in location-based social networks to explore influence maximization. In: The 35th Annual IEEE International Conference on Computer Communications (INFOCOM 2016) (2016)","DOI":"10.1109\/INFOCOM.2016.7524471"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"4_CR9","unstructured":"Leskovec, J.: Stanford large network dataset collection. \n                      http:\/\/snap.stanford.edu\/data"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: ACM SIGKDD, pp. 420\u2013429. ACM (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Han, M., Yan, M., Cai, Z., Li, Y.: An exploration of broader influence maximization in timeliness networks with opportunistic selection. J. Netw. Comput. Appl. (2016, in press)","DOI":"10.1016\/j.jnca.2016.01.004"},{"key":"4_CR12","unstructured":"Nail, J.: The consumer advertising backlash, Forrester Research and Intelliseek Market Research Report, 137, May 2004"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2013I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"ME Newman","year":"2001","unstructured":"Newman, M.E.: The structure of scientific collaboration networks. Proc. Nat. Acad. Sci. 98(2), 404\u2013409 (2001)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"4_CR15","first-page":"31","volume":"73","author":"R Siegmund-Schultze","year":"2009","unstructured":"Siegmund-Schultze, R.: Richard von mises (1883\u20131953): a pioneer of applied mathematics in four countries. Newslett. Eur. Math. Soc. 73, 31\u201334 (2009)","journal-title":"Newslett. Eur. Math. Soc."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD, pp. 75\u201386. ACM (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Shi, T., Wan, J., Cheng, S., Cai, Z., Li, Y., Li, J.: Time-bounded positive influence in social networks. In: International Conference on Identification, Information and Knowledge in the Internet of Things (2015)","DOI":"10.1109\/IIKI.2015.37"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: ACM SIGKDD, pp. 1039\u20131048. ACM (2010)","DOI":"10.1145\/1835804.1835935"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32049-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:25:27Z","timestamp":1559413527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32049-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320489","9783319320496"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32049-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}