{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:07:52Z","timestamp":1769922472901,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,21]],"date-time":"2012-03-21T00:00:00Z","timestamp":1332288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s13278-012-0062-z","type":"journal-article","created":{"date-parts":[[2012,3,20]],"date-time":"2012-03-20T01:11:39Z","timestamp":1332205899000},"page":"179-192","source":"Crossref","is-referenced-by-count":108,"title":["On minimizing budget and time in influence propagation over social networks"],"prefix":"10.1007","volume":"3","author":[{"given":"Amit","family":"Goyal","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"Laks V. S.","family":"Lakshmanan","sequence":"additional","affiliation":[]},{"given":"Suresh","family":"Venkatasubramanian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,21]]},"reference":[{"key":"62_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal N, Liu H, Tang L, Yu P (2011) Modeling blogger influence in a community. Social Netw Anal Min 1\u201324. doi: 10.1007\/s13278-011-0039-3","DOI":"10.1007\/s13278-011-0039-3"},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Bakshy E, Hofman JM, Mason WA, Watts DJ (2011) Everyone\u2019s an influencer: quantifying influence on twitter. In: Proceedings of the fourth ACM international conference on Web search and data mining, ACM, WSDM \u201911, pp 65\u201374","DOI":"10.1145\/1935826.1935845"},{"issue":"1\u20132","key":"62_CR3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0304-3975(99)00130-9","volume":"250","author":"J Bar-Ilan","year":"2001","unstructured":"Bar-Ilan J, Kortsarz G, Peleg D (2001) Generalized submodular cover problems and applications. Theor Comput Sci 250(1\u20132):179\u2013200","journal-title":"Theor Comput Sci"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Zwi O, Hermelin D, Lokshtanov D, Newman I (2009) An exact almost optimal algorithm for target set selection in social networks. In: EC \u201909: Proceedings of the tenth ACM conference on electronic commerce, ACM, New York, NY, USA, pp 355\u2013362","DOI":"10.1145\/1566374.1566424"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Bhagat S, Goyal A, Lakshmanan LVS (2012) Maximizing product adoption in social networks. In: Web search and data mining, WSDM","DOI":"10.1145\/2124295.2124368"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Bross J, Richly K, Kohnen M, Meinel C (2011) Identifying the top-dogs of the blogosphere. Social Netw Anal Min 1\u201315. doi: 10.1007\/s13278-011-0027-7","DOI":"10.1007\/s13278-011-0027-7"},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"Cha M, Trez JP, Haddadi H (2011) The spread of media content through blogs. Social Netw Anal Min 1\u201316. doi: 10.1007\/s13278-011-0040-x","DOI":"10.1007\/s13278-011-0040-x"},{"key":"62_CR8","unstructured":"Chen N (2008) On the approximability of influence in social networks. In: SODA \u201908: Proceedings of the nineteenth annual ACM\u2013SIAM symposium on discrete algorithms, pp 1029\u20131037"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201909)","DOI":"10.1145\/1557019.1557047"},{"key":"62_CR10","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: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201910)","DOI":"10.1145\/1835804.1835934"},{"key":"62_CR11","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010b) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 10th IEEE international conference on data mining (ICDM\u20192010)","DOI":"10.1109\/ICDM.2010.118"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201901, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"4","key":"62_CR13","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of XXX for approximating set cover. J ACM 45(4):634\u2013652","journal-title":"J ACM"},{"issue":"4","key":"62_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0167-6377(99)00045-0","volume":"25","author":"T Fujito","year":"1999","unstructured":"Fujito T (1999) On approximation of the submodular set cover problem. Oper Res Lett 25(4):169\u2013174","journal-title":"Oper Res Lett"},{"key":"62_CR15","unstructured":"Fujito T (2000) Approximation algorithms for submodular set cover with applications. IEICE Trans Inf Syst 83"},{"key":"62_CR16","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LVS (2008) Discovering leaders from community actions. In: Proceeding of the 17th ACM conference on information and knowledge management, ACM, New York, NY, USA, CIKM \u201908, pp 499\u2013508","DOI":"10.1145\/1458082.1458149"},{"key":"62_CR17","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LVS (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on web search and data mining, ACM, New York, NY, USA, WSDM \u201910, pp 241\u2013250","DOI":"10.1145\/1718487.1718518"},{"key":"62_CR18","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LVS (2011) A data-based approach to social influence maximization. PVLDB 5(1)","DOI":"10.14778\/2047485.2047492"},{"key":"62_CR19","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201903)","DOI":"10.1145\/956755.956769"},{"key":"62_CR20","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2005) Influential nodes in a diffusion model for social networks. In: ICALP, Springer, Berlin, pp 1127\u20131138","DOI":"10.1007\/11523468_91"},{"issue":"1","key":"62_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor JS (1999) The budgeted maximum coverage problem. Inf Process Lett 70(1):39\u201345","journal-title":"Inf Process Lett"},{"key":"62_CR22","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: Proceedings of PKDD 2006, Lecture notes in computer science, vol 4213","DOI":"10.1007\/11871637_27"},{"key":"62_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance NS (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201907)","DOI":"10.1145\/1281192.1281239"},{"issue":"2","key":"62_CR24","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.tcs.2006.05.009","volume":"361","author":"I Li G\u00f8rtz","year":"2006","unstructured":"Li G\u00f8rtz I, Wirth A (2006) Asymmetry in k-center variants. Theor Comput Sci 361(2):188\u2013199","journal-title":"Theor Comput Sci"},{"issue":"1","key":"62_CR25","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"issue":"2","key":"62_CR26","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1006\/jagm.1997.0921","volume":"27","author":"R Panigrahy","year":"1998","unstructured":"Panigrahy R, Vishwanathan S (1998) An O(log* n) approximation algorithm for the asymmetric p-center problem. J Algorithms 27(2):259\u2013268","journal-title":"J Algorithms"},{"key":"62_CR27","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201902, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"issue":"5","key":"62_CR28","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0190(97)00182-8","volume":"64","author":"P Slav\u00ed k","year":"1997","unstructured":"Slav\u00ed k P (1997) Improved performance of the greedy algorithm for partial cover. Inform Process Lett 64(5):251\u2013254","journal-title":"Inform Process Lett"},{"issue":"1","key":"62_CR29","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41\u201343","journal-title":"Oper Res Lett"},{"key":"62_CR30","doi-asserted-by":"crossref","unstructured":"Weng J, Lim EP, Jiang J, He Q (2010) Twitterrank: finding topic-sensitive influential twitterers. In: Proceedings of the third ACM international conference on web search and data mining, ACM, New York, NY, USA, WSDM \u201910, pp 261\u2013270","DOI":"10.1145\/1718487.1718520"},{"issue":"4","key":"62_CR31","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey LA (1982) An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4):385\u2013393","journal-title":"Combinatorica"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-012-0062-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-012-0062-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-012-0062-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T16:56:53Z","timestamp":1561481813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-012-0062-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,21]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s13278-012-0062-z","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,21]]}}}