{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:29:14Z","timestamp":1743038954100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934125"},{"type":"electronic","value":"9783030934132"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93413-2_18","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"207-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness Results for Seeding Complex Contagion with Neighborhoods"],"prefix":"10.1007","author":[{"given":"Meher","family":"Chaitanya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrik","family":"Brandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Friedkin, N.E., Johnsen, E.C.: Social Influence Network Theory: A Sociological Examination of Small Group Dynamics. Structural Analysis in the Social Sciences, Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511976735"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Centola, D.: How Behavior Spreads: The Science of Complex Contagions, vol. 3. Princeton University Press (2018)","DOI":"10.23943\/9781400890095"},{"issue":"17","key":"18_CR3","doi-asserted-by":"publisher","first-page":"R976","DOI":"10.1016\/j.cub.2018.04.044","volume":"28","author":"ID Couzin","year":"2018","unstructured":"Couzin, I.D.: Collective animal migration. Curr. Biol. 28(17), R976\u2013R980 (2018)","journal-title":"Curr. Biol."},{"issue":"7","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer Jr","year":"2009","unstructured":"Dreyer, P.A., Jr., Roberts, F.S.: Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion. Discret. Appl. Math. 157(7), 1615\u20131627 (2009)","journal-title":"Discret. Appl. Math."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: 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\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Influential nodes in a diffusion model for social networks. In: International Colloquium on Automata, Languages, and Programming, pp. 1127\u20131138 (2005)","DOI":"10.1007\/11523468_91"},{"issue":"4","key":"18_CR7","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, E.: Maximizing the spread of influence through a social network. Theory Comput. 11(4), 105\u2013147 (2015)","journal-title":"Theory Comput."},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0378-8733(95)00256-1","volume":"18","author":"TW Valente","year":"1996","unstructured":"Valente, T.W.: Social network thresholds in the diffusion of innovations. Social Networks 18(1), 69\u201389 (1996)","journal-title":"Social Networks"},{"key":"18_CR9","unstructured":"Chen, N.: On the approximability of influence in social networks. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1029\u20131037 (2008)"},{"issue":"9","key":"18_CR10","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)","journal-title":"Knowl. Inf. Syst."},{"issue":"7","key":"18_CR11","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1038\/s41562-019-0607-5","volume":"3","author":"D Centola","year":"2019","unstructured":"Centola, D.: Influential networks. Nat. Hum. Behav. 3(7), 664\u2013665 (2019)","journal-title":"Nat. Hum. Behav."},{"issue":"11","key":"18_CR12","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0143611","volume":"10","author":"P Barber\u00e1","year":"2015","unstructured":"Barber\u00e1, P., Wang, N., Bonneau, R., Jost, J.T., Nagler, J., Tucker, J., Gonz\u00e1lez-Bail\u00f3n, S.: The critical periphery in the growth of social protests. PLoS ONE 10(11), e0143611 (2015)","journal-title":"PLoS ONE"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-021-24704-6","volume":"12","author":"D Guilbeault","year":"2021","unstructured":"Guilbeault, D., Centola, D.: Topological measures for identifying and predicting the spread of complex contagions. Nat. Commun. 12, 1\u20139 (2021)","journal-title":"Nat. Commun."},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s13278-012-0067-7","volume":"3","author":"A Nichterlein","year":"2013","unstructured":"Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: On tractable cases of target set selection. Soc. Netw. Anal. Min. 3(2), 233\u2013256 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"10","key":"18_CR16","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1016\/j.disc.2012.01.016","volume":"312","author":"D Reichman","year":"2012","unstructured":"Reichman, D.: New bounds for contagious sets. Discret. Math. 312(10), 1812\u20131814 (2012)","journal-title":"Discret. Math."},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00224-013-9499-3","volume":"55","author":"M Chopin","year":"2014","unstructured":"Chopin, M., Nichterlein, A., Niedermeier, R., Weller, M.: Constant thresholds can make target set selection tractable. Theory Comput. Syst. 55(1), 61\u201383 (2014)","journal-title":"Theory Comput. Syst."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Mishra, S., Radhakrishnan, J., Sivasubramanian, S.: On the hardness of approximating minimum monopoly problems. In: International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 277\u2013288 (2002)","DOI":"10.1007\/3-540-36206-1_25"},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","volume":"89","author":"R Klasing","year":"2004","unstructured":"Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2), 75\u201383 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"18_CR20","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. Theoret. Comput. Sci. 282(2), 231\u2013257 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR21","volume-title":"On approximating target set selection","author":"M Charikar","year":"2016","unstructured":"Charikar, M., Naamad, Y., Wirth, A.: On approximating target set selection. Randomization, and Combinatorial Optimization. Algorithms and Techniques, Approximation (2016)"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M., Williams, R.: On the possibility of faster sat algorithms. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1065\u20131075 (2010)","DOI":"10.1137\/1.9781611973075.86"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93413-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:26:12Z","timestamp":1682627172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93413-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934125","9783030934132"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93413-2_18","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}