{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:55:28Z","timestamp":1725951328851},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811081224"},{"type":"electronic","value":"9789811081231"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-10-8123-1_29","type":"book-chapter","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T09:11:46Z","timestamp":1519377106000},"page":"333-343","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SA-Min: An Efficient Algorithm for Minimizing the Spread of Influence in a Social Network"],"prefix":"10.1007","author":[{"given":"Yong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhe","family":"Han","sequence":"additional","affiliation":[]},{"given":"Shengshu","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Xuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,24]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"issue":"6794","key":"29_CR2","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378\u2013382 (2000)","journal-title":"Nature"},{"issue":"25","key":"29_CR3","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"85","author":"DS Callaway","year":"2000","unstructured":"Callaway, D.S., Newman, M.E.J., Strogatz, S.H., et al.: Network robustness and fragility: percolation on random graphs. Phys. Rev. Lett. 85(25), 5468 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"29_CR4","unstructured":"Kimura, M., Saito, K., Motoda, H.: Minimizing the spread of contamination by blocking links in a network. In: Proceedings of the 23rd National Conference on Artificial Intelligence, pp. 1175\u20131180 (2008)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956755.956769"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.S.: Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Jiang, Q., Song, G., Cong, G., Wang, Y., Si, W., Xie, K.: Simulated Annealing based influence maximization in social networks. In: AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence Maximization Near-Optimal Time Complexity Meets Practical Efficiency. In: Proceedings of the 2015 ACM SIGMOD\/PODS Conference, pp. 796\u2013805 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Lin, S.C., Lin, S.D., Chen, M.S.: A learning-based framework to handle multi-round multi-party influence maximization on social networks. In: Proceedings of the 21st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 410\u2013419 (2015)","DOI":"10.1145\/2783258.2783392"},{"issue":"6","key":"29_CR11","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., et al.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Mitra, D.; Romeo, F.; Vincentelli, A.S.. Convergence and finite-time behavior of simulated Annealing. In: Proceeding of 24th Conference on Decision and Control, pp. 761\u2013767 (1985)","DOI":"10.1109\/CDC.1985.268600"},{"issue":"1","key":"29_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L., Adamic, B.: The dynamics of viral marketing. ACM Trans. Web 1(1), 39 (2007)","journal-title":"ACM Trans. Web"}],"container-title":["Communications in Computer and Information Science","Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-8123-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T07:36:29Z","timestamp":1693553789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-8123-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811081224","9789811081231"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-8123-1_29","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}