{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:16:11Z","timestamp":1743142571547,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031270505"},{"type":"electronic","value":"9783031270512"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27051-2_28","type":"book-chapter","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:03:35Z","timestamp":1678665815000},"page":"330-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Groups Burning: Analyzing Spreading Processes in\u00a0Community-Based Networks"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"issue":"44\u201346","key":"28_CR1","doi-asserted-by":"publisher","first-page":"4017","DOI":"10.1016\/j.tcs.2010.08.021","volume":"411","author":"E Ackerman","year":"2010","unstructured":"Ackerman, E., Ben-Zwi, O., Wolfovitz, G.: Combinatorial model and bounds for target set selection. Theor. Comp. Sci. 411(44\u201346), 4017\u20134022 (2010)","journal-title":"Theor. Comp. Sci."},{"key":"28_CR2","unstructured":"Arora, S., Lund, C.: Hardness of approximation. In: Hochbaum, Ed. D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 399\u2013446 PWS Publishers (1995)"},{"key":"28_CR3","unstructured":"Bandyapadhyay, S., Inamdar, T., Pai, S., Varadarajan, K.: A constant approximation for colorful k-center. arXiv:1907.08906v1 (2019)"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2010.09.007","volume":"8","author":"O Ben-Zwi","year":"2011","unstructured":"Ben-Zwi, O., Hermelin, D., Lokshtanov, D., Newman, I.: Treewidth governs the complexity of target set selection. Discrete Optim. 8(1), 87\u201396 (2011)","journal-title":"Discrete Optim."},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.55016\/ojs\/cdm.v16i1.71194","volume":"16","author":"A Bonato","year":"2021","unstructured":"Bonato, A.: A survey of graph burning. Contr. Discret. Math. 16, 185\u2013197 (2021)","journal-title":"Contr. Discret. Math."},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-14812-6_6","volume-title":"Theory and Applications of Models of Computation","author":"A Bonato","year":"2019","unstructured":"Bonato, A., Kamali, S.: Approximation algorithms for graph burning. In: Gopal, T.V., Watada, J. (eds.) TAMC 2019. LNCS, vol. 11436, pp. 74\u201392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14812-6_6"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-27821-4_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C Chekuri","year":"2004","unstructured":"Chekuri, C., Kumar, A.: Maximum coverage problem with group budget constraints and applications. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX\/RANDOM -2004. LNCS, vol. 3122, pp. 72\u201383. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27821-4_7"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and influence propagation in social networks. In: Synthesis Lectures on Data Management, vol. 5.4 (2013)","DOI":"10.2200\/S00527ED1V01Y201308DTM037"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00224-013-9499-3","volume":"55","author":"M Chopin","year":"2014","unstructured":"Chopin, M., Nichterlein, A., Niedermeier, R., Weller, M.: Constant thresholds can make target set selection tractable. Theory Comput. Syst. 55(1), 61\u201383 (2014). https:\/\/doi.org\/10.1007\/s00224-013-9499-3","journal-title":"Theory Comput. Syst."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.02.027","volume":"535","author":"F Cicalese","year":"2014","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milanic, M., Vaccaro, U.: Latency-bounded target set selection in social networks. Theor. Comp. Sci. 535, 1\u201315 (2014)","journal-title":"Theor. Comp. Sci."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Feige, U., Krivelevich, M., Reichman, D.: Contagious sets in expanders. In: Proceedings of SODA, pp. 1953\u20131987 (2015)","DOI":"10.1137\/1.9781611973730.131"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Influence propagation over large scale social networks. In: Proceedings of ASONAM, pp. 1531\u20131538 (2015)","DOI":"10.1145\/2808797.2808888"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2015.02.032","volume":"586","author":"F Cicalese","year":"2015","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milanic, M., Peters, J., Vaccaro, U.: Spread of influence in weighted networks under time and budget constraints. Theor. Comp. Sci. 586, 40\u201358 (2015)","journal-title":"Theor. Comp. Sci."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0408-z","volume":"6","author":"G Cordasco","year":"2016","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: On finding small sets that influence large networks. Soc. Netw. Anal. Min. 6, 1\u201320 (2016)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1002\/net.21756","volume":"71","author":"G Cordasco","year":"2018","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A., Vaccaro, U.: Evangelism in social networks: algorithms and complexity. Networks 71(4), 346\u2013357 (2018)","journal-title":"Networks"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1007\/s00453-017-0390-5","volume":"80","author":"G Cordasco","year":"2018","unstructured":"Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A.A., Vaccaro, U.: Discovering small target sets in social networks: a fast and effective algorithm. Algorithmica 80, 1804\u20131833 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0390-5","journal-title":"Algorithmica"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2018.02.024","volume":"764","author":"G Cordasco","year":"2019","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Active influence spreading in social networks. Theor. Comp. Sci. 764, 15\u201329 (2019)","journal-title":"Theor. Comp. Sci."},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2018.05.030","volume":"810","author":"G Cordasco","year":"2020","unstructured":"Cordasco, G., et al.: Whom to befriend to influence people. Theor. Comp. Sci. 810, 26\u201342 (2020)","journal-title":"Theor. Comp. Sci."},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2019.07.007","volume":"812","author":"G Cordasco","year":"2020","unstructured":"Cordasco, G., Gargano, L., Peters, J.G., Rescigno, A.A., Vaccaro, U.: Fast and frugal targeting with incentives. Theor. Comp. Sci. 812, 62\u201379 (2020)","journal-title":"Theor. Comp. Sci."},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TNET.2013.2290714","volume":"22","author":"TN Dinh","year":"2014","unstructured":"Dinh, T.N., Zhang, H., Nguyen, D.T., Thai, M.T.: Cost-effective viral marketing for time-critical campaigns in large-scale social networks. IEEE Trans. Net. 22, 2001\u20132011 (2014)","journal-title":"IEEE Trans. Net."},{"key":"28_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected world","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected world. Cambridge University Press, Cambridge (2010)"},{"issue":"C","key":"28_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2015.02.015","volume":"584","author":"L Gargano","year":"2015","unstructured":"Gargano, L., Hell, P., Peters, J.G., Vaccaro, U.: Influence diffusion in social networks under time window constraints. Theor. Comp. Sci. 584(C), 53\u201366 (2015)","journal-title":"Theor. Comp. Sci."},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Jia, X., Sheth, K., Svensson, O.: Fair colorful k-center clustering. arXiv:2007.04059v1 (2020)","DOI":"10.1007\/978-3-030-45771-6_17"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of KDD 2003 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"5","key":"28_CR25","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1057\/jors.1978.94","volume":"29","author":"B Lev","year":"1978","unstructured":"Lev, B., Soyster, A.L.: Integer programming with bounded variables via canonical separation. J. Oper. Res. Soc. 29(5), 477\u2013488 (1978)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"28_CR26","doi-asserted-by":"publisher","first-page":"683","DOI":"10.7155\/jgaa.00244","volume":"15","author":"TVT Reddy","year":"2011","unstructured":"Reddy, T.V.T., Rangan, C.P.: Variants of spreading messages. J. Graph Algorithms Appl. 15(5), 683\u2013699 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"28_CR27","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s13278-013-0135-7","volume":"3","author":"P Shakarian","year":"2013","unstructured":"Shakarian, P., Eyre, S., Paulo, D.: A scalable heuristic for viral marketing under the tipping model. Soc. Netw. Anal. Min. 3(4), 1225\u20131248 (2013). https:\/\/doi.org\/10.1007\/s13278-013-0135-7","journal-title":"Soc. Netw. Anal. Min."},{"issue":"6","key":"28_CR28","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."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27051-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T06:13:07Z","timestamp":1729059187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27051-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031270505","9783031270512"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27051-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hsinchu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.walcom2023.conf.nycu.edu.tw\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"30","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":"40% - 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":"10","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)"}},{"value":"This proceeding includes 2 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}