{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T20:21:43Z","timestamp":1725999703535},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046170"},{"type":"electronic","value":"9783030046187"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04618-7_14","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T15:47:58Z","timestamp":1542383278000},"page":"161-176","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach"],"prefix":"10.1007","author":[{"given":"Qizhi","family":"Fang","sequence":"first","affiliation":[]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Qingqin","family":"Nong","sequence":"additional","affiliation":[]},{"given":"Zongchao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yongchang","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Suning","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"14_CR1","first-page":"946","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Christian Borgs","year":"2013","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: The Proceeding of the 25th SODA, SIAM, pp. 946\u2013957 (2014)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-17572-5_48","volume-title":"Internet and Network Economics","author":"A Borodin","year":"2010","unstructured":"Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 539\u2013550. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_48"},{"doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: The Proceeding of the 20th WWW, pp. 665\u2013674. ACM (2011)","key":"14_CR3","DOI":"10.1145\/1963405.1963499"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"FRK Chung","year":"2006","unstructured":"Chung, F.R.K., Lu, L.: Concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79\u2013127 (2006)","journal-title":"Internet Math."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/s13278-014-0214-4","volume":"4","author":"L Fan","year":"2014","unstructured":"Fan, L., Wu, W., Zhai, X., Xing, K., Lee, W., Du, D.Z.: Maximizing rumor containment in social networks with constrained time. Soc. Netw. Anal. Min. 4(1), 214 (2014)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"01","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1650004","DOI":"10.1142\/S179383091650004X","volume":"8","author":"L Fan","year":"2016","unstructured":"Fan, L., Wu, W., Xing, K., Lee, W.: Precautionary rumor containment via trustworthy people in social networks. Discret. Math. Algorithms Appl. 8(01), 1650004 (2016)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1137\/1.9781611972825.40","volume-title":"Proceedings of the 2012 SIAM International Conference on Data Mining","author":"Xinran He","year":"2012","unstructured":"He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: The Proceeding of the 2012 SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics, pp. 463\u2013474 (2012)"},{"doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: The Proceeding of the 9th SIGKDD, pp. 137\u2013146. ACM (2003)","key":"14_CR8","DOI":"10.1145\/956750.956769"},{"unstructured":"Moore, E.F.: The shortest path through a maze. In: The Proceeding of International Symposium Switching Theory, pp. 285\u2013292 (1959)","key":"14_CR9"},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"LG Nemhauser","year":"1978","unstructured":"Nemhauser, L.G., Wolsey, A.L., Fisher, L.M.: An analysis of approximations for maximizing submodular set functional. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: The Proceedings of the 2016 International Conference on Management of Data, pp. 695\u2013710. ACM (2016)","key":"14_CR11","DOI":"10.1145\/2882903.2915207"},{"unstructured":"Nguyen, H.T., Tsai, J., Jiang, A., Bowring, E., Maheswaran, R., Tambe, M.: Security games on social networks. In: The Proceeding of the 2012 AAAI fall symposium series (2012)","key":"14_CR12"},{"doi-asserted-by":"crossref","unstructured":"Pathak, N., Banerjee, A., Srivastava, J.: A generalized linear threshold model for multiple cascades. In: The Proceeding of the ICDM, pp. 965\u2013970 (2010)","key":"14_CR13","DOI":"10.1109\/ICDM.2010.153"},{"doi-asserted-by":"crossref","unstructured":"Song, C., Hsu, W., Lee, M.L.: Targeted influence maximization in social networks. In: The Proceeding of the 25th ACM International on Conference on Information and Knowledge Management, pp. 1683\u20131692 (2016)","key":"14_CR14","DOI":"10.1145\/2983323.2983724"},{"doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: The Proceeding of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539\u20131554 (2015)","key":"14_CR15","DOI":"10.1145\/2723372.2723734"},{"doi-asserted-by":"crossref","unstructured":"Tong, G., et al.: An efficient randomized algorithm for rumor blocking in online social networks. arXiv preprint arXiv:1701.02368 (2017)","key":"14_CR16","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"14_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vaziran","year":"2002","unstructured":"Vaziran, V.V.: Approximation Algorithms. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"key":"14_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813658","volume-title":"Probability with Martingales","author":"D Williams","year":"1991","unstructured":"Williams, D.: Probability with Martingales. Cambridge University Press, Cambridge (1991)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-21786-4_4","volume-title":"Computational Social Networks","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Zhang, H., Li, X., Thai, M.T.: Limiting the spread of misinformation while effectively raising awareness in social networks. In: Thai, M.T., Nguyen, N.P., Shen, H. (eds.) CSoNet 2015. LNCS, vol. 9197, pp. 35\u201347. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21786-4_4"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T09:58:21Z","timestamp":1710323901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-030-04618-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}
