{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:35:18Z","timestamp":1765546518216},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811501043"},{"type":"electronic","value":"9789811501050"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-981-15-0105-0_9","type":"book-chapter","created":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T15:02:36Z","timestamp":1567263756000},"page":"131-149","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimizing the Spread of Rumor Within Budget Constraint in Online Network"],"prefix":"10.1007","author":[{"given":"Songsong","family":"Mo","sequence":"first","affiliation":[]},{"given":"Shan","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Liwei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,1]]},"reference":[{"issue":"6794","key":"9_CR1","doi-asserted-by":"publisher","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 (2000)","journal-title":"Nature"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-77105-0_31","volume-title":"Internet and Network Economics","author":"S Bharathi","year":"2007","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306\u2013311. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_31"},{"key":"9_CR3","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"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, 28 March\u20131 April 2011, pp. 665\u2013674 (2011). https:\/\/doi.org\/10.1145\/1963405.1963499","DOI":"10.1145\/1963405.1963499"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Carnes, T., Nagarajan, C., Wild, S.M., van Zuylen, A.: Maximizing influence in a competitive social network: a follower\u2019s perspective. In: Proceedings of the 9th International Conference on Electronic Commerce: The Wireless World of Electronic Commerce, 2007, University of Minnesota, Minneapolis, MN, USA, 19\u201322 August 2007, pp. 351\u2013360 (2007). https:\/\/doi.org\/10.1145\/1282100.1282167","DOI":"10.1145\/1282100.1282167"},{"key":"9_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cabridge (2009). http:\/\/mitpress.mit.edu\/books\/introduction-algorithms","edition":"3"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Fan, L., Lu, Z., Wu, W., Thuraisingham, B.M., Ma, H., Bi, Y.: Least cost rumor blocking in social networks. In: IEEE 33rd International Conference on Distributed Computing Systems, ICDCS 2013, Philadelphia, Pennsylvania, USA, 8\u201311 July 2013, pp. 540\u2013549 (2013). https:\/\/doi.org\/10.1109\/ICDCS.2013.34","DOI":"10.1109\/ICDCS.2013.34"},{"key":"9_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-14929-0_4","volume-title":"Advances in Social Network Mining and Analysis, Second International Workshop","author":"Habiba","year":"2008","unstructured":"Habiba, Yu, Y., Berger-Wolf, T.Y., Saia, J.: Finding spread blockers in dynamic networks. In: Giles, L., Smith, M., Yen, J., Zhang, H. (eds.) SNAKDD 2008. LNCS, pp. 55\u201376. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-642-14929-0_4"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-1-4612-0865-5_26","volume-title":"The Collected Works of Wassily Hoeffding","author":"W Hoeffding","year":"1994","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. In: Fisher, N.I., Sen, P.K. (eds.) The Collected Works of Wassily Hoeffding, pp. 409\u2013426. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-1-4612-0865-5_26"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999). https:\/\/doi.org\/10.1016\/S0020-0190(99)00031-9","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9_CR11","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\u2014I. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"issue":"1","key":"9_CR12","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\u2014i. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"035101","DOI":"10.1103\/PhysRevE.66.035101","volume":"66","author":"ME Newman","year":"2002","unstructured":"Newman, M.E., Forrest, S., Balthrop, J.: Email networks and the spread of computer viruses. Phys. Rev. E 66(3), 035101 (2002)","journal-title":"Phys. Rev. E"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Nguyen, N.P., Yan, G., Thai, M.T., Eidenbenz, S.: Containment of misinformation spread in online social networks. In: Web Science 2012, WebSci 2012, Evanston, IL, USA, 22\u201324 June 2012, pp. 213\u2013222 (2012). https:\/\/doi.org\/10.1145\/2380718.2380746","DOI":"10.1145\/2380718.2380746"},{"key":"9_CR15","volume-title":"Principles of Random Walk","author":"F Spitzer","year":"2013","unstructured":"Spitzer, F.: Principles of Random Walk, vol. 34. Springer, Heidelberg (2013)"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Tripathy, R.M., Bagchi, A., Mehta, S.: A study of rumor control strategies on social networks. In: Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, 26\u201330 October 2010. pp. 1817\u20131820 (2010). https:\/\/doi.org\/10.1145\/1871437.1871737","DOI":"10.1145\/1871437.1871737"},{"key":"9_CR17","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"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Zhang, P., Bao, Z., Li, Y., Li, G., Zhang, Y., Peng, Z.: Trajectory-driven influential billboard placement. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2018, London, UK, 19\u201323 August 2018, pp. 2748\u20132757 (2018). https:\/\/doi.org\/10.1145\/3219819.3219946","DOI":"10.1145\/3219819.3219946"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, P., et al.: Proactive rumor control in online networks. World Wide Web 1\u201320 (2018)","DOI":"10.1007\/s11280-017-0441-5"}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-0105-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T02:30:57Z","timestamp":1664245857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-0105-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811501043","9789811501050"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-0105-0_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lanzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nctcs2019.lzu.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}