{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:13:53Z","timestamp":1761621233790},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252575"},{"type":"electronic","value":"9783319252582"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_9","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T07:10:18Z","timestamp":1445238618000},"page":"119-134","source":"Crossref","is-referenced-by-count":17,"title":["Optimizing Spread of Influence in Social Networks via Partial Incentives"],"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"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"9_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. Theoretical Computer Science\u00a0411, 4017\u20134022 (2010)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bakshy, E., Hofman, J.M., Mason, W.A., Watts, D.J.: Everyone\u2019s an influencer: quantifying influence on twitter. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining (WSDM 2011), pp. 65\u201374 (2011)","DOI":"10.1145\/1935826.1935845"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-642-38768-5_48","volume-title":"Computing and Combinatorics","author":"C. Bazgan","year":"2013","unstructured":"Bazgan, C., Chopin, M., Nichterlein, A., Sikora, F.: Parametrized Approximability of Maximizing the Spread of Influence in Networks. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 543\u2013554. Springer, Heidelberg (2013)"},{"key":"9_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 Optimization\u00a08, 87\u201396 (2011)","journal-title":"Discrete Optimization"},{"issue":"29","key":"9_CR5","doi-asserted-by":"publisher","first-page":"3693","DOI":"10.1016\/j.tcs.2011.03.029","volume":"412","author":"C.C. Centeno","year":"2011","unstructured":"Centeno, C.C., et al.: Irreversible conversion of graphs. Theoretical Computer Science\u00a0412(29), 3693\u20133700 (2011)","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-34862-4_9","volume-title":"Design and Analysis of Algorithms","author":"M. Chopin","year":"2012","unstructured":"Chopin, M., Nichterlein, A., Niedermeier, R., Weller, M.: Constant Thresholds Can Make Target Set Selection Tractable. In: Even, G., Rawitz, D. (eds.) MedAlg 2012. LNCS, vol.\u00a07659, pp. 120\u2013133. Springer, Heidelberg (2012)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Feige, U., Krivelevich, M., Reichman, D.: Contagious Sets in Expanders. In: Proceedings of SODA 2015 (1987)","DOI":"10.1137\/1.9781611973730.131"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Lakshmanan, V.S., Castillo, C.: Information and Influence Propagation in Social Networks. Morgan & Claypool (2013)","DOI":"10.2200\/S00527ED1V01Y201308DTM037"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient Influence Maximization in Social Networks. In: Proc. 15th ACM SIGKDD Intl. Conf. on Know. Dis. and Data Min. (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"9_CR10","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. Discrete Math.\u00a023, 1400\u20131415 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/120868864","volume":"27","author":"C.-Y. Chiang","year":"2013","unstructured":"Chiang, C.-Y., Huang, L.-H., Yeh, H.-G.: Target Set Selection Problem for Honeycomb Networks. SIAM J. Discrete Math.\u00a027(1), 310\u2013328 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/s10878-012-9518-3","volume":"25","author":"C.-Y. Chiang","year":"2013","unstructured":"Chiang, C.-Y., Huang, L.-H., Li, B.-J., Wu, J., Yeh, H.-G.: Some results on the target set selection problem. Journal of Comb. Opt.\u00a025(4), 702\u2013715 (2013)","journal-title":"Journal of Comb. Opt."},{"key":"9_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., Milani\u010d, M., Peters, J.G., Vaccaro, U.: Spread of Influence in Weighted Networks under Time and Budget Constraints. Theoretical Computer Science\u00a0586, 40\u201358 (2015)","journal-title":"Theoretical Computer Science"},{"key":"9_CR14","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., Milani\u010d, M., Vaccaro, U.: Latency-Bounded Target Set Selection in Social Networks. Theoretical Computer Science\u00a0535, 1\u201315 (2014)","journal-title":"Theoretical Computer Science"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Christakis, N.A., Fowler, J.H.: The collective dynamics of smoking in a large social network. N. Engl. J. Med., 2249\u20132258 (2008)","DOI":"10.1056\/NEJMsa0706154"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Malec, D.L., Raghavan, S., Sawant, A., Zadimoghadam, M.: How to influence people with partial incentives. In: Proc. of WWW 2014, pp. 937\u2013948 (2014)","DOI":"10.1145\/2566486.2568039"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. of 7th ACM SIGKDD Int. Conf. on Know. Disc. and Data Min., pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511761942"},{"key":"9_CR19","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., Kr\u00e1lovic, R., Ruzicka, P., Roncato, A., Santoro, N.: On time versus size for monotone dynamic monopolies in regular topologies. J. Discrete Algorithms\u00a01, 129\u2013150 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-03578-9_12","volume-title":"Structural Information and Communication Complexity","author":"L. Gargano","year":"2013","unstructured":"Gargano, L., Hell, P., Peters, J., Vaccaro, U.: Influence Diffusion in Social Networks under Time Window Constraints. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol.\u00a08179, pp. 141\u2013152. Springer, Heidelberg (2013)"},{"issue":"6","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M. Granovetter","year":"1978","unstructured":"Granovetter, M.: Thresholds Models of Collective Behaviors. American Journal of Sociology\u00a083(6), 1420\u20131443 (1978)","journal-title":"American Journal of Sociology"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. of 9th ACM SIGKDD Int. Conf. on Know., Disc. and Data Min., pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"D. Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Influential vertices in a Diffusion Model for Social Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1127\u20131138. Springer, Heidelberg (2005)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Leskovic, H., Adamic, L.A., Huberman, B.A.: The dynamic of viral marketing. ACM Transactions on the WEB 1 (2007)","DOI":"10.1145\/1232722.1232727"},{"key":"9_CR25","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection (2015), \n                    \n                      http:\/\/snap.stanford.edu\/data"},{"key":"9_CR26","unstructured":"Newman, M.: Network data (2015), \n                    \n                      http:\/\/www-personal.umich.edu\/~mejn\/netdata\/"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: On Tractable Cases of Target Set Selection. Social Network Analysis and Mining, 1\u201324 (2012)","DOI":"10.1007\/s13278-012-0067-7"},{"issue":"5","key":"9_CR28","doi-asserted-by":"publisher","first-page":"683","DOI":"10.7155\/jgaa.00244","volume":"15","author":"T.V.T. Reddy","year":"2011","unstructured":"Reddy, T.V.T., Rangan, C.P.: Variants of spreading messages. J. Graph Algorithms Appl.\u00a015(5), 683\u2013699 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR29","unstructured":"Zafarani, R., Liu, H.: Social Computing Data Repository at ASU, \n                    \n                      http:\/\/socialcomputing.asu.edu"},{"issue":"6","key":"9_CR30","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.: On dynamic monopolies of graphs with general thresholds. Discrete Mathematics\u00a0312(6), 1136\u20131143 (2012)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:51:01Z","timestamp":1559289061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}