{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:26:48Z","timestamp":1725794808383},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_9","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T16:08:51Z","timestamp":1401293331000},"page":"100-112","source":"Crossref","is-referenced-by-count":2,"title":["How to go Viral: Cheaply and Quickly"],"prefix":"10.1007","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gennaro","family":"Cordasco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph G.","family":"Peters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","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","unstructured":"Alba, J., Hutchinson, J.W., Lynch, J.: Memory and Decision Making. In: Robertson, T.S., Kassarjian, H. (eds.) Handbook of Consumer Behavior (1991)"},{"issue":"6092","key":"9_CR3","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1126\/science.1215842","volume":"337","author":"S. Aral","year":"2012","unstructured":"Aral, S., Walker, D.: Identifying Influential and Susceptible Members of Social Networks. Science\u00a0337(6092), 337\u2013341 (2012)","journal-title":"Science"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Asch, S.E.: Studies of independence and conformity: A minority of one against a unanimous majority. Psychological Monographs 70 (1956)","DOI":"10.1037\/h0093718"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1037\/0033-2909.117.3.497","volume":"117","author":"R.F. Baumeister","year":"1995","unstructured":"Baumeister, R.F., et al.: The need to belong: Desire for interpersonal attachments as a fundamental human motivation. Psychological Bulletin\u00a0117(3), 497\u2013529 (1995)","journal-title":"Psychological Bulletin"},{"key":"9_CR6","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"},{"key":"9_CR7","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.\u00a07936, pp. 543\u2013554. Springer, Heidelberg (2013)"},{"issue":"7","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/j.disc.2007.03.067","volume":"308","author":"J.R.S. Blair","year":"2008","unstructured":"Blair, J.R.S., Goddard, W., Hedetniemi, S.T., Horton, S., Jones, P., Kubicki, G.: On domination and reinforcement numbers in trees. Discrete Mathematics\u00a0308(7), 1165\u20131175 (2008)","journal-title":"Discrete Mathematics"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1038\/nature11421","volume":"489","author":"R.M. Bond","year":"2012","unstructured":"Bond, R.M., et al.: A 61-million-person experiment in social influence and political mobilization. Nature\u00a0489, 295\u2013298 (2012)","journal-title":"Nature"},{"issue":"29","key":"9_CR10","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., Dourado, M.C., Draque Penso, L., Rautenbach, D., Szwarcfiter, J.L.: Irreversible conversion of graphs. Theoretical Computer Science\u00a0412(29), 3693\u20133700 (2011)","journal-title":"Theoretical Computer Science"},{"key":"9_CR11","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."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1287\/mksc.1090.0546","volume":"29","author":"J. Chen","year":"2010","unstructured":"Chen, J., Iver, G., Pazgal, A.: Limited Memory, Categorization and Competition. Marketing Science\u00a029, 650\u2013670 (2010)","journal-title":"Marketing Science"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Chen, W., Lakshmanan, L.V.S., Castillo, C.: Information and Influence Propagation in Social Networks. Morgan & Claypool (2013)","DOI":"10.2200\/S00527ED1V01Y201308DTM037"},{"key":"9_CR14","unstructured":"Chiang, C.Y., et al.: The Target Set Selection Problem on Cycle Permutation Graphs, Generalized Petersen Graphs and Torus Cordalis. arXiv:1112.1313 (2011)"},{"key":"9_CR15","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)"},{"issue":"4","key":"9_CR16","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 Combinatorial Optimization\u00a025(4), 702\u2013715 (2013)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"9_CR17","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."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-39053-1_8","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"F. Cicalese","year":"2013","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milani\u010d, M., Vaccaro, U.: Latency-Bounded Target Set Selection in Social Networks. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol.\u00a07921, pp. 65\u201377. Springer, Heidelberg (2013)"},{"key":"9_CR19","unstructured":"Coja-Oghlan, A., Feige, U., Krivelevich, M., Reichman, D.: Contagious sets in expanders. arXiv:1306.2465"},{"key":"9_CR20","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_CR21","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_CR22","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)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. of the Ninth ACM SIGKDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956755.956769"},{"key":"9_CR24","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.\u00a03580, pp. 1127\u20131138. Springer, Heidelberg (2005)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1080\/10495140903190374","volume":"22","author":"M. Leppaniemi","year":"2007","unstructured":"Leppaniemi, M., Karjaluoto, H., Lehto, H., Goman, A.: Targeting Young Voters in a Political Campaign: Empirical Insights into an Interactive Digital Marketing Campaign in the 2007 Finnish General Election. Journal of Nonprofit & Public Sector Marketing\u00a022, 14\u201337 (2007)","journal-title":"Journal of Nonprofit & Public Sector Marketing"},{"key":"9_CR26","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 (2012)","DOI":"10.1007\/s13278-012-0067-7"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D. Peleg","year":"2002","unstructured":"Peleg, D.: Local majorities, coalitions and monopolies in graphs: a review. Theoretical Computer Science\u00a0282, 231\u2013257 (2002)","journal-title":"Theoretical Computer Science"},{"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":"Surowiecki, J.: The Wisdom of Crowds: Why the Many Are Smarter Than the Few and How Collective Wisdom Shapes Business, Economies, Societies and Nations. Doubleday (2004)"},{"key":"9_CR30","unstructured":"Tumulty, K.: Obama\u2019s Viral Marketing Campaign. TIME Magazine (July 5, 2007)"},{"issue":"6","key":"9_CR31","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","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:33:26Z","timestamp":1558913606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}