{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:41Z","timestamp":1750219841253,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Instituto Federal Goiano"},{"name":"FAPERJ"},{"name":"FAPEG"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,6]]},"DOI":"10.1145\/3625007.3627726","type":"proceedings-article","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:12:42Z","timestamp":1710515562000},"page":"419-426","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Greedy Heuristic for Majority Target Set Selection in Social Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3521-1306","authenticated-orcid":false,"given":"Braully Rocha da","family":"Silva","sequence":"first","affiliation":[{"name":"DTI-Reitoria, Instituto Federal Goiano, Goi\u00e2nia, GO, Brazil"},{"name":"Instituto de Inform\u00e1tica, Universidade Federal de Goias, Goi\u00e2nia, GO, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3234-5789","authenticated-orcid":false,"given":"Erika Morais Martins","family":"Coelho","sequence":"additional","affiliation":[{"name":"Instituto de Inform\u00e1tica, Universidade Federal de Goias, Goi\u00e2nia, GO, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9727-0006","authenticated-orcid":false,"given":"Hebert Coelho da","family":"Coelho","sequence":"additional","affiliation":[{"name":"Instituto de Inform\u00e1tica, Universidade Federal de Goias, Goi\u00e2nia, GO, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9924-0079","authenticated-orcid":false,"given":"Fabio","family":"Protti","sequence":"additional","affiliation":[{"name":"Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense, Niter\u00f3i, RJ, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2024,3,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mining KnowledgeSharing Sites for Viral Marketing,\" Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Richardson M.","year":"2002","unstructured":"M. Richardson and P. Domingos, \"Mining KnowledgeSharing Sites for Viral Marketing,\" Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073617X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0012"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21972"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2021.11.014"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1337624"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2912583.2912687"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.012"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.029"},{"key":"e_1_3_2_1_11_1","first-page":"378","volume-title":"On tractable cases of target set selection","author":"Nichterlein A.","year":"2010","unstructured":"A. Nichterlein, R. Niedermeier, J. Uhlmann, and M. Weller, \"On tractable cases of target set selection,\" vol. 3, 12 2010, pp. 378--389."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.09.007"},{"key":"e_1_3_2_1_13_1","first-page":"120","volume-title":"Constant thresholds can make target set selection tractable","author":"Chopin M.","year":"2012","unstructured":"M. Chopin, A. Nichterlein, R. Niedermeier, and M. Weller, \"Constant thresholds can make target set selection tractable,\" vol. 55, 12 2012, pp. 120--133."},{"key":"e_1_3_2_1_14_1","first-page":"11","article-title":"Some results on the target set selection problem","volume":"25","author":"Chiang C.-Y.","year":"2011","unstructured":"C.-Y. Chiang, L.-H. Huang, B.-J. Li, J. Wu, and H.-G. Yeh, \"Some results on the target set selection problem,\" Journal of Combinatorial Optimization, vol. 25, 11 2011.","journal-title":"Journal of Combinatorial Optimization"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104808"},{"key":"e_1_3_2_1_16_1","first-page":"1","volume-title":"On Approximating Target Set Selection,\" in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM","author":"Charikar M.","year":"2016","unstructured":"M. Charikar, Y. Naamad, and A. Wirth, \"On Approximating Target Set Selection,\" in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2016), ser. Leibniz International Proceedings in Informatics (LIPIcs), K. Jansen, C. Mathieu, J. D. P. Rolim, and C. Umans, Eds., vol. 60. Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2016, pp. 4:1--4:16."},{"key":"e_1_3_2_1_17_1","first-page":"137","volume-title":"Theory and Practice of Computer Science","author":"Hartmann T. A.","year":"2018","unstructured":"T. A. Hartmann, \"Target set selection parameterized by clique-width and maximum threshold,\" in SOFSEM 2018: Theory and Practice of Computer Science, A. M. Tjoa, L. Bellatreche, S. Biffl, J. van Leeuwen, and J. Wiedermann, Eds. Cham: Springer International Publishing, 2018, pp. 137--149."},{"key":"e_1_3_2_1_18_1","first-page":"141","volume-title":"The 2nd Israel Symposium on Theory and Computing Systems","author":"Linial N.","year":"1993","unstructured":"N. Linial, D. Peleg, Y. Rabinovich, and M. Saks, \"Sphere packing and local majorities in graphs,\" in [1993] The 2nd Israel Symposium on Theory and Computing Systems, 1993, pp. 141--149."},{"issue":"2","key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(98)00043-2","article-title":"Size bounds for dynamic monopolies","volume":"86","author":"Peleg D.","year":"1998","unstructured":"D. Peleg, \"Size bounds for dynamic monopolies,\" Discrete Applied Mathematics, vol. 86, no. 2, pp. 263--273, 1998.","journal-title":"Discrete Applied Mathematics"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2001.2045"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00055-X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.09.033"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0135-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0390-5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"e_1_3_2_1_27_1","volume-title":"Jun.","author":"Leskovec J.","year":"2014","unstructured":"J. Leskovec and A. Krevl, \"SNAP Datasets: Stanford large network dataset collection,\" http:\/\/snap.stanford.edu\/data, Jun. 2014."},{"key":"e_1_3_2_1_28_1","volume-title":"Social computing data repository at ASU","author":"Zafarani R.","year":"2009","unstructured":"R. Zafarani and H. Liu, \"Social computing data repository at ASU,\" 2009. [Online]. Available: http:\/\/socialcomputing.asu.edu"}],"event":{"name":"ASONAM '23: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Kusadasi Turkiye","acronym":"ASONAM '23"},"container-title":["Proceedings of the International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625007.3627726","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3625007.3627726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:50Z","timestamp":1750178810000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625007.3627726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":28,"alternative-id":["10.1145\/3625007.3627726","10.1145\/3625007"],"URL":"https:\/\/doi.org\/10.1145\/3625007.3627726","relation":{},"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"2024-03-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}