{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T00:40:23Z","timestamp":1731804023963,"version":"3.28.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T00:00:00Z","timestamp":1714003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T00:00:00Z","timestamp":1714003200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01164-4","type":"journal-article","created":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T05:01:51Z","timestamp":1714021311000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs"],"prefix":"10.1007","volume":"47","author":[{"given":"Siavash","family":"Askari","sequence":"first","affiliation":[]},{"given":"Manouchehr","family":"Zaker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,25]]},"reference":[{"key":"1164_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 (2010) Combinatorial model and bounds for target set selection. Theor Comput Sci 411:4017\u20134022","journal-title":"Theor Comput Sci"},{"key":"1164_CR2","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen N (2009) On the approximability of influence in social networks. SIAM J Discrete Math 23:1400\u20131415","journal-title":"SIAM J Discrete Math"},{"key":"1164_CR3","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Rescigno AA, Vaccaro U (2015) Optimizing spread of influence in social networks via partial incentives. In: International colloquium on structural information and communication complexity, pp 119\u2013134","DOI":"10.1007\/978-3-319-25258-2_9"},{"key":"1164_CR4","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 AA (2019) Active influence spreading in social networks. Theor Comput Sci 764:15\u201329","journal-title":"Theor Comput Sci"},{"key":"1164_CR5","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Lafond M, Narayanan L, Rescigno AA, Vaccaro U, Wu K (2020a) Whom to befriend to influence people. Theor Comput Sci 810:26\u201342","DOI":"10.1016\/j.tcs.2018.05.030"},{"key":"1164_CR6","doi-asserted-by":"crossref","unstructured":"Cordasco G, Gargano L, Peters JG, Rescigno AA, Vaccaro U (2020b) Fast and frugal targeting with incentives. Theor Comput Sci 812:62\u201379","DOI":"10.1016\/j.tcs.2019.07.007"},{"key":"1164_CR7","doi-asserted-by":"crossref","unstructured":"Demaine ED, Hajiaghayi M, Mahini H, Malec DL, Raghavan S, Sawant A, Zadimoghadam M (2014) How to influence people with partial incentives. In: Proceedings of the 23rd international conference on World wide web, pp 937\u2013948","DOI":"10.1145\/2566486.2568039"},{"key":"1164_CR8","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer","year":"2009","unstructured":"Dreyer PA, Roberts FS (2009) Irreversible $$k$$-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl Math 157:1615\u20131627","journal-title":"Discrete Appl Math"},{"key":"1164_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.05.004","volume":"34","author":"S Ehard","year":"2019","unstructured":"Ehard S, Rautenbach D (2019) On some tractable and hard instances for partial incentives and target set selection. Discrete Optim 34:100547","journal-title":"Discrete Optim"},{"key":"1164_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.dam.2021.09.003","volume":"305","author":"U Feige","year":"2021","unstructured":"Feige U, Kogan Sh (2021) Target set selection for conservative populations. Discrete Appl Math 305:119\u2013132","journal-title":"Discrete Appl Math"},{"key":"1164_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S1570-8667(03)00022-4","volume":"1","author":"P Flocchini","year":"2003","unstructured":"Flocchini P, Kralovic R, Roncato A, Ruzicka P, Santoro N (2003) On time versus size for monotone dynamic monopolies in regular topologies. J Discrete Algorithms 1:129\u2013150","journal-title":"J Discrete Algorithms"},{"key":"1164_CR12","doi-asserted-by":"crossref","unstructured":"G\u00fcnne\u00e7 D, Raghavan S, Zhang R (2020a) A branch-and-cut approach for the least cost influence problem on social networks. Networks 76:84\u2013105","DOI":"10.1002\/net.21941"},{"key":"1164_CR13","doi-asserted-by":"crossref","unstructured":"G\u00fcnne\u00e7 D, Raghavan S, Zhang R (2020b) Least-cost influence maximization on social networks. INFORMS J Comput 32:289\u2013302","DOI":"10.1287\/ijoc.2019.0886"},{"key":"1164_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2015) Maximizing the spread of influence through a social network. Theory Comput 11:105\u2013147","journal-title":"Theory Comput"},{"key":"1164_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2012.02.001","volume":"9","author":"K Khoshkhah","year":"2012","unstructured":"Khoshkhah K, Soltani H, Zaker M (2012) On dynamic monopolies of graphs: the average and strict majority thresholds. Discrete Optim 9:77\u201383","journal-title":"Discrete Optim"},{"key":"1164_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2014.02.006","volume":"171","author":"K Khoshkhah","year":"2014","unstructured":"Khoshkhah K, Soltani H, Zaker M (2014) Dynamic monopolies in directed graphs: spread of unilateral influence in social networks. Discrete Appl Math 171:81\u201389","journal-title":"Discrete Appl Math"},{"key":"1164_CR17","doi-asserted-by":"publisher","DOI":"10.1590\/0101-7438.2023.043.00275468","volume":"43","author":"RS Melo","year":"2023","unstructured":"Melo RS, Vignatti AL, Miyazawa FK, Ota MJ (2023) Combinatorial dual bounds on the least cost influence problem. Pesquisa Operacional 43:e275468","journal-title":"Pesquisa Operacional"},{"key":"1164_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2018.07.013","volume":"811","author":"L Narayanan","year":"2020","unstructured":"Narayanan L, Wu K (2020) How to choose friends strategically. Theor Comput Sci 811:99\u2013111","journal-title":"Theor Comput Sci"},{"key":"1164_CR19","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1002\/net.21972","volume":"77","author":"S Raghavan","year":"2021","unstructured":"Raghavan S, Zhang R (2021) Weighted target set selection on trees and cycles. Networks 77:587\u2013609","journal-title":"Networks"},{"key":"1164_CR20","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1016\/j.disc.2011.11.038","volume":"312","author":"M Zaker","year":"2012","unstructured":"Zaker M (2012) On dynamic monopolies of graphs with general thresholds. Discrete Math 312:1136\u20131143","journal-title":"Discrete Math"},{"key":"1164_CR21","doi-asserted-by":"publisher","first-page":"2716","DOI":"10.1016\/j.dam.2013.04.012","volume":"161","author":"M Zaker","year":"2013","unstructured":"Zaker M (2013) Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs. Discrete Appl Math 161:2716\u20132723","journal-title":"Discrete Appl Math"},{"key":"1164_CR22","doi-asserted-by":"crossref","first-page":"60","DOI":"10.55016\/ojs\/cdm.v15i2.68115","volume":"15","author":"M Zaker","year":"2020","unstructured":"Zaker M (2020) On irreversible spread of influence in edge-weighted graphs. Contrib Discrete Math 15:60\u201372","journal-title":"Contrib Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01164-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T00:11:01Z","timestamp":1731802261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01164-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,25]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1164"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01164-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,4,25]]},"assertion":[{"value":"31 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"61"}}