{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:55:56Z","timestamp":1743098156801,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319217857"},{"type":"electronic","value":"9783319217864"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21786-4_8","type":"book-chapter","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T04:06:09Z","timestamp":1438229169000},"page":"84-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Social Influence Spectrum with Guarantees: Computing More in Less Time"],"prefix":"10.1007","author":[{"given":"Thang","family":"Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Preetam","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Mayo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD 2003, pp. 137\u2013146. ACM, New York (2003)","DOI":"10.1145\/956750.956769"},{"key":"8_CR2","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 KDD 2007, pp. 420\u2013429. ACM, New York (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: ACM KDD 2010, pp. 1029\u20131038. ACM, New York (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.: Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 211\u2013220. IEEE (2011)","DOI":"10.1109\/ICDM.2011.132"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp. 47\u201348. ACM (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: Scaling up with guarantees. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 629\u2013638. ACM (2014)","DOI":"10.1145\/2661829.2662077"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.i.: Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: Twenty-Eighth AAAI Conference on Artificial Intelligence (2014)","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386. ACM (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"8_CR9","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 2011, pp. 427\u2013436. IEEE Computer Society, Washington, DC (2011)","DOI":"10.1109\/ICDM.2011.99"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 946\u2013957. SIAM (2014)","DOI":"10.1137\/1.9781611973402.70"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of ACM 45(4), 634\u2013652 (1998)","journal-title":"Journal of ACM"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Minoux, M.: Accelerated greedy algorithms for maximizing submodular set functions. In: Stoer, J. (ed.) Optimization Techniques. LNCIS, vol. 7., 234\u2013243. Springer (1978)","DOI":"10.1007\/BFb0006528"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM Journal of Discrete Mathematics 23(3), 1400\u20131415 (2009)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.: Learning influence probabilities in social networks. In: Proceedings of the third ACM International Conference on Web Search and Data Mining, pp. 241\u2013250. ACM (2010)","DOI":"10.1145\/1718487.1718518"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kutzkov, K., Bifet, A., Bonchi, F., Gionis, A.: Strip: stream learning of influence probabilities. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 275\u2013283. ACM (2013)","DOI":"10.1145\/2487575.2487657"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Dinh, T., Zhang, H., Nguyen, D., Thai, M.: Cost-effective viral marketing for time-critical campaigns in large-scale social networks. IEEE\/ACM Transactions on Networking (2014)","DOI":"10.1109\/TNET.2013.2290714"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, H., Dinh, T., Thai, M.: Maximizing the spread of positive influence in online social networks. In: 2013 IEEE 33rd International Conference on Distributed Computing Systems (ICDCS), pp. 317\u2013326 (July 2013)","DOI":"10.1109\/ICDCS.2013.37"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Li, Y., Chen, W., Wang, Y., Zhang, Z.: Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 657\u2013666. ACM (2013)","DOI":"10.1145\/2433396.2433478"},{"key":"8_CR19","unstructured":"Chen, W., Lu, W., Zhang, N.: Time-critical influence maximization in social networks with time-delayed diffusion process. In: Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Shen, Y., Dinh, T.N., Zhang, H., Thai, M.T.: Interest-matching information propagation in multiple online social networks. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, pp. 1824\u20131828. ACM, New York (2012)","DOI":"10.1145\/2396761.2398525"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen, D., Zhang, H., Das, S., Thai, M., Dinh, T.: Least cost influence in multiplex social networks: Model representation and analysis. In: 2013 IEEE 13th International Conference on Data Mining (ICDM), pp. 567\u2013576 (December 2013)","DOI":"10.1109\/ICDM.2013.24"},{"issue":"5","key":"8_CR22","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539797315306","volume":"29","author":"P Dagum","year":"2000","unstructured":"Dagum, P., Karp, R., Luby, M., Ross, S.: An optimal algorithm for monte carlo estimation. SIAM J. Comput. 29(5), 1484\u20131496 (2000)","journal-title":"SIAM J. Comput."},{"key":"8_CR23","unstructured":"Vazirani, V.: Approximation Algorithms. Springer (2001)"},{"key":"8_CR24","unstructured":"Wald, A.: Sequential Analysis. John Wiley and Sons (1947)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 211\u2013220. IEEE (2011)","DOI":"10.1109\/ICDM.2011.132"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp. 47\u201348. ACM (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: WWW 2010: Proceedings of the 19th International Conference on World Wide Web, pp. 591\u2013600. ACM, New York (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"D Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Influential Nodes in a Diffusion Model for Social Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127\u20131138. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21786-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:52:06Z","timestamp":1676973126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21786-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319217857","9783319217864"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21786-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"31 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}