{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:42:10Z","timestamp":1782790930836,"version":"3.54.5"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-RSS2016-004"],"award-info":[{"award-number":["NRF-RSS2016-004"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE2017-T1-002-024"],"award-info":[{"award-number":["MOE2017-T1-002-024"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE2015-T2-2-069"],"award-info":[{"award-number":["MOE2015-T2-2-069"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","award":["SUG"],"award-info":[{"award-number":["SUG"]}],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61772491"],"award-info":[{"award-number":["No.61772491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61472460"],"award-info":[{"award-number":["No.61472460"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["No.BK20161256"],"award-info":[{"award-number":["No.BK20161256"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00778-020-00615-8","type":"journal-article","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T18:05:25Z","timestamp":1591121125000},"page":"1385-1406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Efficient approximation algorithms for adaptive influence maximization"],"prefix":"10.1007","volume":"29","author":[{"given":"Keke","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0785-707X","authenticated-orcid":false,"given":"Jing","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aixin","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,1]]},"reference":[{"key":"615_CR1","doi-asserted-by":"crossref","unstructured":"Arora, A., Galhotra, S., Ranu, S.: Debunking the myths of influence maximization: an in-depth benchmarking study. In: Proceedings of ACM SIGMOD, pp. 651\u2013666 (2017)","DOI":"10.1145\/3218967"},{"key":"615_CR2","doi-asserted-by":"crossref","unstructured":"Badanidiyuru A, Papadimitriou, C., Rubinstein, A., Seeman, L., Singer, Y.: Locally adaptive optimization: adaptive seeding for monotone submodular functions. In: Proceedings of SODA, pp. 414\u2013429 (2016)","DOI":"10.1137\/1.9781611974331.ch31"},{"key":"615_CR3","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of SODA, pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"615_CR4","unstructured":"Chen, W., Peng, B.: On adaptivity gaps of influence maximization under the independent cascade model with full adoption feedback. In: Proceedings of ISAAC, pp. 24:1\u201324:19 (2019)"},{"key":"615_CR5","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of ACM KDD, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"615_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of ACM KDD, pp. 1029\u20131038 (2010a)","DOI":"10.1145\/1835804.1835934"},{"key":"615_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of IEEE ICDM, pp. 88\u201397 (2010b)","DOI":"10.1109\/ICDM.2010.118"},{"key":"615_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Peng, B., Schoenebeck, G., Tao, B.: Adaptive greedy versus non-adaptive greedy for influence maximization. In: Proceedings of AAAI (2020)","DOI":"10.1609\/aaai.v34i01.5398"},{"key":"615_CR9","unstructured":"Chen, Y., Krause, A.: Near-optimal batch mode active learning and adaptive submodular optimization. In: Proceedings of ICML, pp. 160\u2013168 (2013)"},{"key":"615_CR10","unstructured":"Chen, Y., Hassani, S.H., Karbasi, A., Krause, A.: Sequential information maximization: when is greedy near-optimal? In: Proceedings of COLT, pp. 338\u2013363 (2015)"},{"key":"615_CR11","unstructured":"Cuong, N.V., Lee, W.S., Ye, N., Chai, K.M.A., Chieu, H.L.: Active learning for probabilistic hypotheses using the maximum gibbs error criterion. In: Proceedings of NeurIPS, pp. 1457\u20131465 (2013)"},{"issue":"4","key":"615_CR12","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\ln n$$ for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"615_CR13","doi-asserted-by":"crossref","unstructured":"Galhotra, S., Arora, A., Roy, S.: Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In: Proceedings of ACM SIGMOD, pp. 743\u2013758 (2016)","DOI":"10.1145\/2882903.2882929"},{"issue":"1","key":"615_CR14","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42(1), 427\u2013486 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"615_CR15","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: Proceedings of IEEE ICDM, pp. 211\u2013220 (2011)","DOI":"10.1109\/ICDM.2011.132"},{"issue":"9","key":"615_CR16","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.14778\/3213880.3213883","volume":"11","author":"K Han","year":"2018","unstructured":"Han, K., Huang, K., Xiao, X., Tang, J., Sun, A., Tang, X.: Efficient algorithms for adaptive influence maximization. Proc. VLDB Endowment 11(9), 1029\u20131040 (2018)","journal-title":"Proc. VLDB Endowment"},{"issue":"1","key":"615_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1177\/0278364912467485","volume":"32","author":"GA Hollinger","year":"2013","unstructured":"Hollinger, G.A., Englot, B., Hover, F.S., Mitra, U., Sukhatme, G.S.: Active planning for underwater inspection and the benefit of adaptivity. Int. J. Robot. Res. 32(1), 3\u201318 (2013)","journal-title":"Int. J. Robot. Res."},{"key":"615_CR18","doi-asserted-by":"crossref","unstructured":"Horel, T., Singer, Y.: Scalable methods for adaptively seeding a social network. In: Proceedings of WWW, pp. 441\u2013451 (2015)","DOI":"10.1145\/2736277.2741127"},{"issue":"9","key":"615_CR19","doi-asserted-by":"publisher","first-page":"913","DOI":"10.14778\/3099622.3099623","volume":"10","author":"K Huang","year":"2017","unstructured":"Huang, K., Wang, S., Bevilacqua, G., Xiao, X., Lakshmanan, L.V.S.: Revisiting the stop-and-stare algorithms for influence maximization. Proc. VLDB Endowment 10(9), 913\u2013924 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"615_CR20","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of ACM KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"615_CR21","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection (2014) http:\/\/snap.stanford.edu\/data"},{"key":"615_CR22","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks. In: Proceedings of ACM KDD, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"issue":"6","key":"615_CR23","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s00778-017-0467-4","volume":"26","author":"R Li","year":"2017","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Finding influential communities in massive networks. VLDB J. 26(6), 751\u2013776 (2017)","journal-title":"VLDB J."},{"issue":"1","key":"615_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00778-017-0485-2","volume":"27","author":"C Lin","year":"2018","unstructured":"Lin, C., Lu, J., Wei, Z., Wang, J., Xiao, X.: Optimal algorithms for selecting top-k combinations of attributes: theory and applications. VLDB J. 27(1), 27\u201352 (2018)","journal-title":"VLDB J."},{"key":"615_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"615_CR26","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of ACM SIGMOD, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"615_CR27","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.: Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: Proceedings of AAAI, pp. 138\u2013144 (2014)","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"615_CR28","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Sonobe, T., Fujita, S., Kawarabayashi, K.: Coarsening massive influence networks for scalable diffusion analysis. In: Proceedings of ACM SIGMOD, pp. 635\u2013650 (2017)","DOI":"10.1145\/3035918.3064045"},{"key":"615_CR29","unstructured":"Peng, B., Chen, W.: Adaptive influence maximization with myopic feedback. In: Proceedings of NeurIPS, pp. 5575\u20135584 (2019)"},{"key":"615_CR30","doi-asserted-by":"crossref","unstructured":"Seeman, L., Singer, Y.: Adaptive seeding in social networks. In: Proceedings of IEEE FOCS, pp. 459\u2013468 (2013)","DOI":"10.1109\/FOCS.2013.56"},{"key":"615_CR31","doi-asserted-by":"crossref","unstructured":"Sun, L., Huang, W., Yu, P.S., Chen, W.: Multi-round influence maximization. In: Proceedings of ACM KDD, pp. 2249\u20132258 (2018)","DOI":"10.1145\/3219819.3220101"},{"key":"615_CR32","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Influence maximization meets efficiency and effectiveness: a hop-based approach. In: Proceedings of IEEE\/ACM ASONAM, pp. 64\u201371 (2017)","DOI":"10.1145\/3110025.3110041"},{"key":"615_CR33","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Xiao, X., Yuan, J.: Online processing algorithms for influence maximization. In: Proceedings of ACM SIGMOD, pp. 991\u20131005 (2018a)","DOI":"10.1145\/3183713.3183749"},{"key":"615_CR34","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"Tang, J., Tang, X., Yuan, J.: An efficient and effective hop-based approach for inluence maximization in social networks. Soc. Netw. Anal. Min. 8, 10 (2018b)","journal-title":"Soc. Netw. Anal. Min."},{"key":"615_CR35","doi-asserted-by":"crossref","unstructured":"Tang, J., Huang, K., Xiao, X., Lakshmanan, L.V., Tang, X., Sun, A., Lim, A.: Efficient approximation algorithms for adaptive seed minimization. In: Proceedings of ACM SIGMOD, pp. 1096\u20131113 (2019)","DOI":"10.1145\/3299869.3319881"},{"key":"615_CR36","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of ACM SIGMOD, pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"615_CR37","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: A martingale approach. In: Proceedings of ACM SIGMOD, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"615_CR38","unstructured":"Vaswani, S., Lakshmanan, L.V.S.: Adaptive influence maximization in social networks: why commit when you can adapt? arXiv preprint, arXiv:1604.08171 (2016)"},{"key":"615_CR39","unstructured":"Yadav, A., Chan, H., Xin\u00a0Jiang, A., Xu, H., Rice, E., Tambe, M.: Using social networks to aid homeless shelters: dynamic influence maximization under uncertainty. In: Proceedings of AAMAS, pp. 740\u2013748 (2016)"},{"key":"615_CR40","doi-asserted-by":"crossref","unstructured":"Yuan, J., Tang, S.: No time to observe: adaptive influence maximization with partial feedback. In: Proceedings of IJCAI, pp. 3908\u20133914 (2017)","DOI":"10.24963\/ijcai.2017\/546"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00615-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-020-00615-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00615-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T04:12:17Z","timestamp":1666757537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-020-00615-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,1]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1007\/s00778-020-00615-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,1]]},"assertion":[{"value":"13 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}