{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:03:36Z","timestamp":1770984216575,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,7,25]],"date-time":"2014-07-25T00:00:00Z","timestamp":1406246400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s13278-014-0214-4","type":"journal-article","created":{"date-parts":[[2014,7,24]],"date-time":"2014-07-24T11:08:10Z","timestamp":1406200090000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Maximizing rumor containment in social networks with constrained time"],"prefix":"10.1007","volume":"4","author":[{"given":"Lidan","family":"Fan","sequence":"first","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xuming","family":"Zhai","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Wonjun","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,25]]},"reference":[{"issue":"6","key":"214_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.ipl.2009.12.009","volume":"110","author":"N Alon","year":"2010","unstructured":"Alon N, Feldman M, Procaccia AD, Tennenholtz M (2010) A note on competitive diffusion through social networks. Inf Process Lett 110(6):221\u2013225","journal-title":"Inf Process Lett"},{"key":"214_CR2","doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceeding of the WINE, pp 306\u2013311","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"214_CR3","doi-asserted-by":"crossref","unstructured":"Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: Proceeding of the WINE, pp 539\u2013550","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"214_CR4","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, El Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Proceeding of the WWW","DOI":"10.1145\/1963405.1963499"},{"key":"214_CR5","doi-asserted-by":"crossref","unstructured":"Carnes T, Nagarajan C, Wild SM, van Zuylen A (2007) Maximizing influence in a competitive social network: a follower\u2019s perspective. In: ICEC \u201907: Proceedings of the ninth international conference on electronic commerce, New York. ACM, New York, pp 351\u2013360","DOI":"10.1145\/1282100.1282167"},{"key":"214_CR6","unstructured":"Chen W, Lu W, Zhang N (2012a) Time-critical influence maximization in social networks with time-delayed diffusion process (full technical report). CoRR abs\/1204.3074"},{"key":"214_CR7","unstructured":"Chen W, Lu W, Zhang N (2012b) Time-critical influence maximization in social networks with time-delayed diffusion process. In: Proceeding of the AAAI, pp 1\u20135"},{"key":"214_CR8","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010a) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceeding of the KDD, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"214_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceeding of the KDD, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"214_CR10","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010b) Scalable influence maximization in social networks under the linear threshold model. In: Proceeding of the ICDM, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"214_CR11","doi-asserted-by":"crossref","unstructured":"Fan L, Lu Z, Wu W, Thuraisingham B, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: Proceeding of the ICDCS","DOI":"10.1109\/ICDCS.2013.34"},{"key":"214_CR12","doi-asserted-by":"crossref","unstructured":"Goyal S, Kearns M (2012) Competitive contagion in networks. In: Proceeding of the 44th ACM symposium on theory of computing (STOC), pp 759\u2013774","DOI":"10.1145\/2213977.2214046"},{"key":"214_CR13","doi-asserted-by":"crossref","unstructured":"He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceeding of the SDM","DOI":"10.1137\/1.9781611972825.40"},{"key":"214_CR14","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, \u00c9 Tardos (2003) Maximizing the spread of influence through a social network. In: Proceeding of the KDD","DOI":"10.1145\/956750.956769"},{"key":"214_CR15","doi-asserted-by":"crossref","unstructured":"Kostka J, Oswald YA, Wattenhofer R (2008) Word of mouth: rumor dissemination in social networks. In: Proceeding of the SIROCCO, pp 185\u2013196","DOI":"10.1007\/978-3-540-69355-0_16"},{"key":"214_CR16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser G, Wolsey L, Fisher M (1978) An analysis of the approximations for maximizing submodular set functions. Math Program 14:265\u2013294","journal-title":"Math Program"},{"key":"214_CR17","doi-asserted-by":"crossref","unstructured":"Nguyen NP, Yan G, Thai MT, Eidenbenz S (2012) Containment of misinformation spread in online social networks. In: Proceeding of the WebSci","DOI":"10.1145\/2380718.2380746"},{"key":"214_CR18","unstructured":"Nguyen TH, Tsai J, Jiang A, Bowring E, Maheswaran R, Tambe M (2012) Security games on social networks. In: Proceeding of the 2012 AAAI fall symposium series"},{"key":"214_CR19","doi-asserted-by":"crossref","unstructured":"Pathak N, Banerjee A, Srivastava J (2010) A generalized linear threshold model for multiple cascades. In: Proceeding of the ICDM, pp 965\u2013970","DOI":"10.1109\/ICDM.2010.153"},{"key":"214_CR20","doi-asserted-by":"crossref","first-page":"056102","DOI":"10.1103\/PhysRevE.81.056102","volume":"81","author":"D Trpevski","year":"2010","unstructured":"Trpevski D, Tang WKS, Kocarev L (2010) Model for rumor spreading over networks. Phys Rev E 81:056102","journal-title":"Phys Rev E"},{"key":"214_CR21","doi-asserted-by":"crossref","unstructured":"Tsai J, Nguyen TH, Tambe M (2012) Security games for controlling contagion. In: Proceeding of the 26th national conference in articial intelligence","DOI":"10.1109\/SocialCom.2013.11"},{"key":"214_CR22","doi-asserted-by":"crossref","unstructured":"Tsai J, Qian Y, Vorobeychik Y, Kiekintveld C, Tambe M (2013) Bayesian security games for controlling contagion. In: Ito, Jonker, Gini, Shehory (eds) Proceedings of the 12th international conference on autonomous agents and multiagent systems (AAMAS 2013), May, Saint Paul, Minnesota, USA, pp 6\u201310","DOI":"10.1109\/SocialCom.2013.11"},{"key":"214_CR23","doi-asserted-by":"crossref","unstructured":"Tzoumas V, Amanatidis C, Markakis E (2012) A game-theoretic analysis of a competitive diffusion process over social networks. In: Proceeding of the 8th international workshop on internet and network economics (WINE), vol 7695 of Lecture Notes in Computer Science. Springer, Berlin, pp 1\u201314","DOI":"10.1007\/978-3-642-35311-6_1"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-014-0214-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-014-0214-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-014-0214-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T04:14:18Z","timestamp":1565669658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-014-0214-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,25]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["214"],"URL":"https:\/\/doi.org\/10.1007\/s13278-014-0214-4","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,25]]},"article-number":"214"}}