{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:57:19Z","timestamp":1743152239426,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606014"},{"type":"electronic","value":"9783031605994"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60599-4_7","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:02:09Z","timestamp":1716800529000},"page":"111-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the\u00a0Cost of\u00a0Leveraging Influencers in\u00a0Social Networks: IP and\u00a0CP Approaches"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8967-8576","authenticated-orcid":false,"given":"Felipe de C.","family":"Pereira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9529-4253","authenticated-orcid":false,"given":"Pedro J.","family":"de Rezende","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8308-7812","authenticated-orcid":false,"given":"Tallys","family":"Yunes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"issue":"44","key":"7_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. Theoret. Comput. Sci. 411(44), 4017\u20134022 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.08.021","journal-title":"Theoret. Comput. Sci."},{"issue":"9","key":"7_CR2","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee, S., Jenamani, M., Pratihar, D.K.: A survey on influence maximization in a social network. Knowl. Inf. Syst. 62(9), 3417\u20133455 (2020). https:\/\/doi.org\/10.1007\/s10115-020-01461-4","journal-title":"Knowl. Inf. Syst."},{"key":"7_CR3","unstructured":"Bollob\u00e1s, B., Borgs, C., Chayes, J., Riordan, O.: Directed scale-free graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 132-139. SODA \u201903, Society for Industrial and Applied Mathematics, USA (2003)"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.bushor.2020.03.003","volume":"63","author":"C Campbell","year":"2020","unstructured":"Campbell, C., Farrell, J.R.: More than meets the eye: the functional components underlying influencer marketing. Bus. Horiz. 63(4), 469\u2013479 (2020). https:\/\/doi.org\/10.1016\/j.bushor.2020.03.003","journal-title":"Bus. Horiz."},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math. 23(3), 1400\u20131415 (2009). https:\/\/doi.org\/10.1137\/08073617X","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR6","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. Theoret. Comput. Sci. 764, 15\u201329 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.02.024","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-031-36402-0_8","volume-title":"Multi-disciplinary Trends in Artificial Intelligence","author":"RK Gautam","year":"2023","unstructured":"Gautam, R.K., Kare, A.S., Bhavani, S.D.: Centrality measures based heuristics for perfect awareness problem in social networks. In: Morusupalli, R., Dandibhotla, T.S., Atluri, V.V., Windridge, D., Lingras, P., Komati, V.R. (eds.) MIWAI 2023. LNCS, vol. 14078, pp. 91\u2013100. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-36402-0_8"},{"key":"7_CR8","unstructured":"Gecode Team: Gecode \u2014 generic constraint development environment (2023). http:\/\/www.gecode.org"},{"key":"7_CR9","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems, pp. 85\u2013103. Springer US, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: 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-146. KDD 2003, ACM, New York, NY, USA (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C Miller","year":"1960","unstructured":"Miller, C., Tucker, A., Zemlin, R.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326\u2013329 (1960). https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"J. ACM"},{"key":"7_CR13","unstructured":"Pereira, F.C.: A computational study of the Perfect Awareness Problem. Master\u2019s thesis, University of Campinas, Brazil (2021). http:\/\/hdl.handle.net\/20.500.12733\/1641217"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Pereira, F.C., de Rezende, P.J.: The Least Cost Directed Perfect Awareness Problem \u2013 Benchmark Instances and Solutions. Mendeley Data, V2 (2023). https:\/\/doi.org\/10.17632\/xgtjgzf28r","DOI":"10.17632\/xgtjgzf28r"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Pereira, F.C., de Rezende, P.J.: The least cost directed perfect awareness problem: complexity, algorithms and computations. Online Soc. Netw. Media 37\u201338 (2023). https:\/\/doi.org\/10.1016\/j.osnem.2023.100255","DOI":"10.1016\/j.osnem.2023.100255"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Pereira, F.C., de Rezende, P.J., de Souza, C.C.: Effective heuristics for the perfect awareness problem. Procedia Comput. Sci. 195, 489\u2013498 (2021). https:\/\/doi.org\/10.1016\/j.procs.2021.11.059, proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium","DOI":"10.1016\/j.procs.2021.11.059"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Pereira, F.C., de Rezende, P.J., Yunes, T.: Minimizing the cost of leveraging influencers in social networks: IP and CP approaches - complementary data. Mendeley Data, V2 (2023). https:\/\/doi.org\/10.17632\/tkk5pdswty","DOI":"10.17632\/tkk5pdswty"},{"key":"7_CR18","unstructured":"Perron, L., Didier, F.: CP-SAT (Google OR-Tools) (2023). https:\/\/developers.google.com\/optimization\/cp\/cp_solver\/"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive grasp: an application to a matrix decomposition problem in TDMA traffic assignment. Informs J. Comput. 12(3), 164\u2013176 (2000). https:\/\/doi.org\/10.1287\/ijoc.12.3.164.12639","journal-title":"Informs J. Comput."},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/ijoo.2019.0012","volume":"1","author":"S Raghavan","year":"2019","unstructured":"Raghavan, S., Zhang, R.: A branch-and-cut approach for the weighted target set selection problem on social networks. Informs J. Optimiz. 1(4), 304\u2013322 (2019). https:\/\/doi.org\/10.1287\/ijoo.2019.0012","journal-title":"Informs J. Optimiz."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Schweimer, C., et al.: Generating simple directed social network graphs for information spreading. In: Proceedings of the ACM Web Conference 2022, pp. 1475\u20131485. WWW 2022, ACM, New York, USA (2022). https:\/\/doi.org\/10.1145\/3485447.3512194","DOI":"10.1145\/3485447.3512194"},{"issue":"4","key":"7_CR22","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."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60599-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:03:15Z","timestamp":1716800595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60599-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606014","9783031605994"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60599-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","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":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}