{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:22:00Z","timestamp":1743117720741,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914332"},{"type":"electronic","value":"9783030914349"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91434-9_21","type":"book-chapter","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T07:04:42Z","timestamp":1638515082000},"page":"231-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Groups Influence with Minimum Cost in\u00a0Social Networks"],"prefix":"10.1007","author":[{"given":"Phuong N. H.","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Canh V.","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hieu V.","family":"Duong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trung Thanh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,4]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10115-013-0646-6","volume":"37","author":"N Barbieri","year":"2013","unstructured":"Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. Knowl. Inf. Syst. 37(3), 555\u2013584 (2013)","journal-title":"Knowl. Inf. Syst."},{"key":"21_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"},{"key":"21_CR3","series-title":"Synthesis Lectures on Data Management","doi-asserted-by":"publisher","DOI":"10.2200\/S00527ED1V01Y201308DTM037","volume-title":"Information and Influence Propagation in Social Networks","author":"W Chen","year":"2013","unstructured":"Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and Influence Propagation in Social Networks. Synthesis Lectures on Data Management, Morgan & Claypool Publishers, San Rafael (2013)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: ICDM 2010, The 10th IEEE International Conference on Data Mining, pp. 88\u201397 (2010)","DOI":"10.1109\/ICDM.2010.118"},{"issue":"1","key":"21_CR5","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.: Survey: concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79\u2013127 (2006)","journal-title":"Internet Math."},{"issue":"5","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539797315306","volume":"29","author":"P Dagum","year":"2000","unstructured":"Dagum, P., Karp, R.M., Luby, M., Ross, S.M.: An optimal algorithm for Monte Carlo estimation. SIAM J. Comput. 29(5), 1484\u20131496 (2000)","journal-title":"SIAM J. Comput."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Farnadi, G., Babaki, B., Gendreau, M.: A unifying framework for fairness-aware influence maximization. In: Companion of The 2020 Web Conference 2020, Taipei, Taiwan, 20\u201324 April 2020, pp. 714\u2013722 (2020)","DOI":"10.1145\/3366424.3383555"},{"issue":"4","key":"21_CR8","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. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s13278-012-0062-z","volume":"3","author":"A Goyal","year":"2013","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.S., Venkatasubramanian, S.: On minimizing budget and time in influence propagation over social networks. Soc. Netw. Anal. Min. 3(2), 179\u2013192 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"key":"21_CR10","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 Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/TNET.2019.2898413","volume":"27","author":"X Li","year":"2019","unstructured":"Li, X., Smith, J.D., Dinh, T.N., Thai, M.T.: TipTop: (almost) exact solutions for influence maximization in billion-scale networks. IEEE\/ACM Trans. Netw. 27(2), 649\u2013661 (2019)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"10","key":"21_CR12","first-page":"1070","volume":"8","author":"Y Li","year":"2015","unstructured":"Li, Y., Zhang, D., Tan, K.: Targeted influence maximization for online advertisements. PVLDB 8(10), 1070\u20131081 (2015)","journal-title":"PVLDB"},{"issue":"7","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1109\/TKDE.2019.2904969","volume":"32","author":"HT Nguyen","year":"2020","unstructured":"Nguyen, H.T., Cano, A., Vu, T., Dinh, T.N.: Blocking self-avoiding walks stops cyber-epidemics: a scalable GPU-based approach. IEEE Trans. Knowl. Data Eng. 32(7), 1263\u20131275 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"21_CR14","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: International Conference on Management of Data, SIGMOD, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"issue":"4","key":"21_CR15","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","volume":"25","author":"HT Nguyen","year":"2017","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE\/ACM Trans. Netw. 25(4), 2419\u20132429 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"21_CR16","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen, H., Zheng, R.: On budgeted influence maximization in social networks. IEEE J. Sel. Areas Commun. 31(6), 1084\u20131094 (2013)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Nguyen, L.N., Zhou, K., Thai, M.T.: Influence maximization at community level: a new challenge with non-submodularity. In: 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019, pp. 327\u2013337 (2019)","DOI":"10.1109\/ICDCS.2019.00040"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-04648-4_2","volume-title":"Computational Data and Social Networks","author":"CV Pham","year":"2018","unstructured":"Pham, C.V., Duong, H.V., Bui, B.Q., Thai, M.T.: Budgeted competitive influence maximization on online social networks. In: Chen, X., Sen, A., Li, W.W., Thai, M.T. (eds.) CSoNet 2018. LNCS, vol. 11280, pp. 13\u201324. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04648-4_2"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Pham, C.V., Pham, D.V., Bui, B.Q., Nguyen, A.V.: Minimum budget for misinformation detection in online social networks with provable guarantees. Optim. Lett. 1\u201330 (2021)","DOI":"10.1007\/s11590-021-01733-0"},{"issue":"4","key":"21_CR20","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1007\/s10878-019-00439-5","volume":"38","author":"CV Pham","year":"2019","unstructured":"Pham, C.V., Phu, Q.V., Hoang, H.X., Pei, J., Thai, M.T.: Minimum budget for misinformation blocking in online social networks. J. Comb. Optim. 38(4), 1101\u20131127 (2019)","journal-title":"J. Comb. Optim."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Xiao, X., Yuan, J.: Online processing algorithms for influence maximization. In: Proceedings of the 2018 International Conference on Management of Data, pp. 991\u20131005. Association for Computing Machinery (2018)","DOI":"10.1145\/3183713.3183749"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Tsang, A., Wilder, B., Rice, E., Tambe, M., Zick, Y.: Group-fairness in influence maximization. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, pp. 5997\u20136005 (2019)","DOI":"10.24963\/ijcai.2019\/831"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Ye, M., Liu, X., Lee, W.: Exploring social influence for recommendation: a generative model approach. In: International ACM Conference on research and development in Information Retrieval, SIGIR 2012, pp. 671\u2013680 (2012)","DOI":"10.1145\/2348283.2348373"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, H., Alim, M.A., Li, X., Thai, M.T., Nguyen, H.T.: Misinformation in online social networks: detect them all with a limited budget. ACM Trans. Inf. Syst. 34(3), 18:1\u201318:24 (2016)","DOI":"10.1145\/2885494"},{"key":"21_CR26","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"},{"issue":"6","key":"21_CR27","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/TCSS.2019.2938575","volume":"6","author":"J Zhu","year":"2019","unstructured":"Zhu, J., Ghosh, S., Wu, W.: Group influence maximization problem in social networks. IEEE Trans. Comput. Soc. Syst. 6(6), 1156\u20131164 (2019)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-030-34980-6_13","volume-title":"Computational Data and Social Networks","author":"J Zhu","year":"2019","unstructured":"Zhu, J., Ghosh, S., Wu, W., Gao, C.: Profit maximization under group influence model in social networks. In: Tagarelli, A., Tong, H. (eds.) CSoNet 2019. LNCS, vol. 11917, pp. 108\u2013119. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34980-6_13"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91434-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:43:08Z","timestamp":1710232988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91434-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914332","9783030914349"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91434-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/","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":"57","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":"24","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":"8","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":"42% - 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","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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}