{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:04:57Z","timestamp":1765544697542,"version":"build-2065373602"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T00:00:00Z","timestamp":1712016000000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1016\/j.tcs.2018.07.013","type":"journal-article","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T12:32:54Z","timestamp":1533040374000},"page":"99-111","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["How to choose friends strategically"],"prefix":"10.1016","volume":"811","author":[{"given":"Lata","family":"Narayanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangkang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2018.07.013_br0010","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/j.disopt.2010.09.007","article-title":"Treewidth governs the complexity of target set selection","volume":"8","author":"Ben-Zwi","year":"2011","journal-title":"Discrete Optim."},{"key":"10.1016\/j.tcs.2018.07.013_br0020","series-title":"Proceedings of the ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"946","article-title":"Maximizing social influence in nearly optimal time","author":"Borgs","year":"2014"},{"key":"10.1016\/j.tcs.2018.07.013_br0030","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1086\/209118","article-title":"Social ties and word-of-mouth referral behavior","author":"Brown","year":"1987","journal-title":"J. Consum. Res."},{"key":"10.1016\/j.tcs.2018.07.013_br0040","series-title":"Proceedings of the Symposium on Discrete Algorithms","first-page":"1029","article-title":"On the approximability of influence in social networks","author":"Chen","year":"2008"},{"key":"10.1016\/j.tcs.2018.07.013_br0050","series-title":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"199","article-title":"Efficient influence maximization in social networks","author":"Chen","year":"2009"},{"key":"10.1016\/j.tcs.2018.07.013_br0060","series-title":"Fun with Algorithms","first-page":"100","article-title":"How to go viral: cheaply and quickly","volume":"vol. 8496","author":"Cicalese","year":"2014"},{"key":"10.1016\/j.tcs.2018.07.013_br0070","series-title":"The Nature of Computation. Logic, Algorithms, Applications","first-page":"65","article-title":"Latency-bounded target set selection in social networks","volume":"vol. 7921","author":"Cicalese","year":"2013"},{"key":"10.1016\/j.tcs.2018.07.013_br0080","series-title":"Proceedings of SIROCCO","first-page":"119","article-title":"Optimizing spread of influence in social networks via partial incentives","author":"Cordasco","year":"2015"},{"key":"10.1016\/j.tcs.2018.07.013_br0090","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(97)00213-6","article-title":"An upper bound on the sum of squares of degrees in a graph","volume":"185","author":"de Caen","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2018.07.013_br0100","series-title":"Proceedings of the International Conference on World Wide Web","first-page":"937","article-title":"How to influence people with partial incentives","author":"Demaine","year":"2014"},{"issue":"6","key":"10.1016\/j.tcs.2018.07.013_br0110","doi-asserted-by":"crossref","DOI":"10.1109\/TNET.2013.2290714","article-title":"Cost-effective viral marketing for time-critical campaigns in large-scale social networks","volume":"22","author":"Dinh","year":"2014","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.tcs.2018.07.013_br0120","series-title":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"57","article-title":"Mining the network value of customers","author":"Domingos","year":"2001"},{"key":"10.1016\/j.tcs.2018.07.013_br0130","series-title":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"401","article-title":"Information cascade at group scale","author":"Eftekhar","year":"2013"},{"key":"10.1016\/j.tcs.2018.07.013_br0140","series-title":"LATIN 2012: Theoretical Informatics","first-page":"315","article-title":"On the non-progressive spread of influence through social networks","volume":"vol. 7256","author":"Fazli","year":"2012"},{"key":"10.1016\/j.tcs.2018.07.013_br0150","series-title":"Proceedings of SIROCCO","first-page":"141","article-title":"Influence diffusion in social networks under time window constraints","volume":"vol. 8179","author":"Gargano","year":"2013"},{"key":"10.1016\/j.tcs.2018.07.013_br0160","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1011122126881","article-title":"Talk of the network: a complex systems look at the underlying process of word-of-mouth","volume":"12","author":"Goldenberg","year":"2001","journal-title":"Mark. Lett."},{"key":"10.1016\/j.tcs.2018.07.013_br0170","doi-asserted-by":"crossref","first-page":"73","DOI":"10.14778\/2047485.2047492","article-title":"A data-based approach to social influence maximization","volume":"5","author":"Goyal","year":"2011","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.tcs.2018.07.013_br0180","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s13278-012-0062-z","article-title":"On minimizing budget and time in influence propagation over social networks","volume":"3","author":"Goyal","year":"2013","journal-title":"Soc. Netw. Anal. Min."},{"key":"10.1016\/j.tcs.2018.07.013_br0190","series-title":"Proceedings of the International Conference Companion on World Wide Web","first-page":"47","article-title":"Celf++: optimizing the greedy algorithm for influence maximization in social networks","author":"Goyal","year":"2011"},{"year":"2012","series-title":"Integrating Social Network Effects in the Share-of-Choice Problem","author":"Gunnec","key":"10.1016\/j.tcs.2018.07.013_br0200"},{"year":"2013","series-title":"The Least Cost Influence Problem","author":"Gunnec","key":"10.1016\/j.tcs.2018.07.013_br0210"},{"key":"10.1016\/j.tcs.2018.07.013_br0220","series-title":"Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing","first-page":"93","article-title":"Minimum-sized influential node set selection for social networks under the independent cascade model","author":"He","year":"2014"},{"key":"10.1016\/j.tcs.2018.07.013_br0230","series-title":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.tcs.2018.07.013_br0240","series-title":"Proceedings of the International Conference on Automata, Languages and Programming","first-page":"1127","article-title":"Influential nodes in a diffusion model for social networks","author":"Kempe","year":"2005"},{"key":"10.1016\/j.tcs.2018.07.013_br0250","series-title":"Proceedings of SIROCCO","article-title":"Whom to befriend to influence people","author":"Lafond","year":"2016"},{"key":"10.1016\/j.tcs.2018.07.013_br0260","series-title":"Proceedings of the International Conference Companion on World Wide Web","first-page":"67","article-title":"Maximizing the spread of positive influence by deadline","author":"Lamba","year":"2016"},{"key":"10.1016\/j.tcs.2018.07.013_br0270","series-title":"Proceedings of the ACM Conference on Electronic Commerce","first-page":"228","article-title":"The dynamics of viral marketing","author":"Leskovec","year":"2006"},{"key":"10.1016\/j.tcs.2018.07.013_br0280","series-title":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"928","article-title":"The bang for the buck: fair competitive viral marketing from the host perspective","author":"Lu","year":"2013"},{"key":"10.1016\/j.tcs.2018.07.013_br0290","series-title":"Web Technologies and Applications","first-page":"23","article-title":"Influence maximization in independent cascade model with limited propagation distance","volume":"vol. 8710","author":"Lv","year":"2014"},{"key":"10.1016\/j.tcs.2018.07.013_br0300","doi-asserted-by":"crossref","first-page":"2176","DOI":"10.1137\/080714452","article-title":"Submodularity of influence in social networks: from local to global","volume":"39","author":"Mossel","year":"2010","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2018.07.013_br0310","series-title":"Proceedings of the International Conference on Management of Data","first-page":"695","article-title":"Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks","author":"Nguyen","year":"2016"},{"issue":"2","key":"10.1016\/j.tcs.2018.07.013_br0320","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s13278-012-0067-7","article-title":"On tractable cases of target set selection","volume":"3","author":"Nichterlein","year":"2012","journal-title":"Soc. Netw. Anal. Min."},{"key":"10.1016\/j.tcs.2018.07.013_br0330","series-title":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"61","article-title":"Mining knowledge-sharing sites for viral marketing","author":"Richardson","year":"2002"},{"author":"Tang","key":"10.1016\/j.tcs.2018.07.013_br0340"},{"key":"10.1016\/j.tcs.2018.07.013_br0350","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"1539","article-title":"Influence maximization in near-linear time: a martingale approach","author":"Tang","year":"2015"},{"key":"10.1016\/j.tcs.2018.07.013_br0360","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"75","article-title":"Influence maximization: near-optimal time complexity meets practical efficiency","author":"Tang","year":"2014"},{"key":"10.1016\/j.tcs.2018.07.013_br0370","series-title":"Proceedings of the International Conference on Management of Data","first-page":"727","article-title":"Continuous influence maximization: what discounts should we offer to social network users?","author":"Yang","year":"2016"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518304948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518304948?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:01:48Z","timestamp":1759626108000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397518304948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":37,"alternative-id":["S0304397518304948"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2018.07.013","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2020,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"How to choose friends strategically","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2018.07.013","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}