{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T13:00:40Z","timestamp":1765976440154,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030692438"},{"type":"electronic","value":"9783030692445"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-69244-5_24","type":"book-chapter","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:36:12Z","timestamp":1613838972000},"page":"274-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximizing Group Coverage in Social Networks"],"prefix":"10.1007","author":[{"given":"Yuting","family":"Zhong","sequence":"first","affiliation":[]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Peihuang","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,21]]},"reference":[{"key":"24_CR1","unstructured":"Pedro, D., Matt, R.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366 (2001)"},{"key":"24_CR2","unstructured":"Pablo, A.E., Pablo, V., Kazumi, S.: Selecting the most influential nodes in social networks. In: 2007 International Joint Conference on Neural Networks, pp. 2397\u20132402. IEEE (2007)"},{"key":"24_CR3","unstructured":"Wei, C., Yajun, W., Siyu, Y.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199\u2013208 (2009)"},{"key":"24_CR4","unstructured":"Wei, C., Yifei, Y., Li, Z.: Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE International Conference on Data Mining, pp. 88\u201397. IEEE (2010)"},{"key":"24_CR5","unstructured":"Amit, G., Wei, L., Laks, V.S.L.: Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining, pp. 211\u2013220. IEEE (2011)"},{"key":"24_CR6","unstructured":"Guo-Liang, L., Ya-Ping, C., Jian-Hua, F., Yao-Qiang, X.: Influence maximization on multiple social networks. Chinese J. Comput. 39(4), 643\u2013656 (2016)"},{"key":"24_CR7","unstructured":"David, K., Jon, K., \u00c9va, T.: 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)"},{"key":"24_CR8","unstructured":"Jure, L., Andreas, K., Carlos, G., Christos, F., Jeanne, V., Natalie, G.: Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429 (2007)"},{"key":"24_CR9","unstructured":"Amit, G., Wei, L., Laks, V.S.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 (2011)"},{"key":"24_CR10","unstructured":"Christian, B., Michael, B., Jennifer, C., Brendan, L.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. SIAM (2014)"},{"key":"24_CR11","unstructured":"Youze, T., Xiaokui, X., Yanchen, S.: 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 (2014)"},{"key":"24_CR12","unstructured":"Youze, T., Yanchen, S., Xiaokui, 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)"},{"key":"24_CR13","unstructured":"Hung, T.N., My, T.T., Thang, N.D.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, pp. 695\u2013710 (2016)"},{"key":"24_CR14","unstructured":"Tianyu, C., Xindong, W., Song, W., Xiaohua, H.: Oasnet: an optimal allocation approach to influence maximization in modular social networks. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1088\u20131094 (2010)"},{"key":"24_CR15","unstructured":"Yu, W., Gao, C., Guojie, S., Kunqing, X.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1039\u20131048 (2010)"},{"key":"24_CR16","unstructured":"Jin-chao, J., Lan, H., Zhe, W., Hong-ming, L., San-yi, L.: A new approach to maximizing the spread of influence based on community structure. J. Jilin University (Science Edition), 1, 23 (2011)"},{"issue":"6","key":"24_CR17","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang, H., Shen, H., Meng, Z., Chang, H., He, H.: Community-based influence maximization for viral marketing. Appl. Intell. 49(6), 2137\u20132150 (2019). https:\/\/doi.org\/10.1007\/s10489-018-1387-8","journal-title":"Appl. Intell."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi, A., Samet, S., Kwisthout, J., Wareham, T.: Community-based influence maximization in social networks under a competitive linear threshold model. Knowledge-Based Syst. 134, 149\u2013158 (2017)","journal-title":"Knowledge-Based Syst."},{"issue":"6","key":"24_CR19","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., Weili, 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."},{"issue":"3","key":"24_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3313904","volume":"11","author":"G Schoenebeck","year":"2019","unstructured":"Schoenebeck, G., Tao, B.: Beyond worst-case (in) approximability of nonsubmodular influence maximization. ACM Trans. Comput. Theory (TOCT) 11(3), 1\u201356 (2019)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Francis, B., et al.: Learning with submodular functions: a convex optimization perspective. Found. Trends\u00ae Machine Learn. 6(2\u20133), 145\u2013373 (2013)","DOI":"10.1561\/2200000039"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Wei, L., Wei, C., Laks, V.S.L.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endowment, 9(2), 60\u201371 (2015)","DOI":"10.14778\/2850578.2850581"},{"key":"24_CR23","unstructured":"Benedek, R., Rik, S.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: The 29th ACM Conference on Information and Knowledge Management, abs\/2005.07959 (2020)"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69244-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:45:35Z","timestamp":1613839535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69244-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692438","9783030692445"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69244-5_24","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":"21 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hpcc.siat.ac.cn\/meeting\/pdcat-paap2020\/index.html","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","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":"34","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":"31% - 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)"}}]}}