{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T21:44:08Z","timestamp":1785966248674,"version":"3.56.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319266251","type":"print"},{"value":"9783319266268","type":"electronic"}],"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-26626-8_15","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T09:08:43Z","timestamp":1449652123000},"page":"193-208","source":"Crossref","is-referenced-by-count":13,"title":["A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Mecchia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"15_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. Comput. Sci. 411, 4017\u20134022 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR2","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.: Parameterized approximability of maximizing the spread of influence in networks. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 543\u2013554. Springer, Heidelberg (2013)"},{"key":"15_CR3","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, 87\u201396 (2011)","journal-title":"Discrete Optim."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1038\/nature11421","volume":"489","author":"RM Bond","year":"2012","unstructured":"Bond, R.M., et al.: A 61-million-person experiment in social influence and political mobilization. Nature 489, 295\u2013298 (2012)","journal-title":"Nature"},{"issue":"29","key":"15_CR5","doi-asserted-by":"publisher","first-page":"3693","DOI":"10.1016\/j.tcs.2011.03.029","volume":"412","author":"CC Centeno","year":"2011","unstructured":"Centeno, C.C., et al.: Irreversible conversion of graphs. Theor. Comput. Sci. 412(29), 3693\u20133700 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR6","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. 23, 1400\u20131415 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR7","volume-title":"Information and Influence Propagation in Social Networks","author":"W Chen","year":"2013","unstructured":"Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and Influence Propagation in Social Networks. Morgan & Claypool, San Francisco (2013)"},{"key":"15_CR8","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. 7659, pp. 120\u2013133. Springer, Heidelberg (2012)"},{"issue":"1","key":"15_CR9","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. 27(1), 310\u2013328 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"15_CR10","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. J. Comb. Opt. 25(4), 702\u2013715 (2013)","journal-title":"J. Comb. Opt."},{"key":"15_CR11","unstructured":"Christakis, N.A., Fowler, J.H.: Connected: The surprising Power of our Social Networks and how they Shape our Lives. Little, Brown (2011)"},{"key":"15_CR12","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. Theoret. Comput. Sci. 535, 1\u201315 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"15_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. Theor. Comput. Sci. 586, 40\u201358 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Feige, U., Krivelevich, M., Reichman, D.: Contagious sets in expanders. In: Proceedings of SODA 2015, pp. 1953\u20131987 (2015)","DOI":"10.1137\/1.9781611973730.131"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., et al.: How to influence people with partial incentives. In: Proceedings of WWW 2014, pp. 937\u2013948 (2014)","DOI":"10.1145\/2566486.2568039"},{"issue":"6","key":"15_CR16","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\/ACM ToN 22(6), 2001\u20132011 (2014)","journal-title":"IEEE\/ACM ToN"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: ACM International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"15_CR18","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)"},{"key":"15_CR19","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., Vaccaro, U.: Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. 584, 53\u201366 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 83, 1420\u20131443 (1978)","journal-title":"Am. J. Sociol."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"15_CR22","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 nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127\u20131138. Springer, Heidelberg (2005)"},{"key":"15_CR23","unstructured":"Lately, D.: An army of eyeballs: the rise of the advertisee. The Baffler, 12 Septmeber 2014"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1080\/10495140903190374","volume":"22","author":"M Leppaniemi","year":"2010","unstructured":"Leppaniemi, M., et al.: Targeting young voters in apolitical campaign: empirical insights into an interactive digitalmarketing campaign in the 2007 Finnish general election. J. Nonprofit Public Sect. Mark. 22, 14\u201337 (2010)","journal-title":"J. Nonprofit Public Sect. Mark."},{"key":"15_CR25","unstructured":"Leskovec, J., Sosi\u010d, R.: SNAP: a general purpose network analysis and graph mining library in C++ (2014). http:\/\/snap.stanford.edu\/snap"},{"issue":"1","key":"15_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1232722.1232723","volume":"1","author":"H Leskovic","year":"2007","unstructured":"Leskovic, H., Adamic, L.A., Huberman, B.A.: The dynamic of viral marketing. J. ACM Trans. Web (TWEB) 1(1), 1\u201339 (2007). Article No 5","journal-title":"J. ACM Trans. Web (TWEB)"},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s13278-012-0067-7","volume":"3","author":"A Nichterlein","year":"2012","unstructured":"Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: On tractable cases of target set selection. Soc. Netw. Anal. Min. 3, 233\u2013256 (2012)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"5","key":"15_CR28","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."},{"key":"15_CR29","unstructured":"Rival, J.-B., Walach, J.: The use of viral marketing in politics: a case study of the 2007 French presidential election. Master Thesis, J\u00f6nk\u00f6ping University"},{"key":"15_CR30","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, 1225\u20131248 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"key":"15_CR31","unstructured":"Tumulty, K.: Obama\u2019s viral marketing campaign. TIME Mag. (2007). http:\/\/content.time.com\/time\/magazine\/article\/0,9171,1640402,00.html"},{"key":"15_CR32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"15_CR33","unstructured":"Zafarani, R., Liu, H.: Social Computing Data Repository at ASU (2009). http:\/\/socialcomputing.asu.edu"},{"issue":"6","key":"15_CR34","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 Math. 312(6), 1136\u20131143 (2012)","journal-title":"Discrete Math."},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, H., Mishra, S., Thai, M.T.: Recent advances in information diffusion and influence maximization of complex social networks. In: Wu, J., Wang, Y. (eds.) Opportunistic Mobile Social Networks. CRC Press, Taylor & Francis Group (2014, to appear)","DOI":"10.1201\/b17231-3"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T17:57:49Z","timestamp":1653760669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}