{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:01:39Z","timestamp":1762351299978,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T00:00:00Z","timestamp":1631145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T00:00:00Z","timestamp":1631145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832012","61672321"],"award-info":[{"award-number":["61832012","61672321"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10898-021-01076-1","type":"journal-article","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T06:02:48Z","timestamp":1631167368000},"page":"413-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Adaptive seeding for profit maximization in social networks"],"prefix":"10.1007","volume":"82","author":[{"given":"Chuangen","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuyang","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6451-1158","authenticated-orcid":false,"given":"Jiguo","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"1076_CR1","doi-asserted-by":"publisher","unstructured":"Asadpour, A., Nazerzadeh, H., Saberi, A.: Stochastic submodular maximization. In: Proceedings of the 4th International Workshop on Internet and Network Economics, WINE \u201908, pp. 477\u2013489. Springer-Verlag, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_53","DOI":"10.1007\/978-3-540-92185-1_53"},{"key":"1076_CR2","doi-asserted-by":"publisher","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: International Conference on Knowledge Discovery and Data Mining, KDD \u201910, pp. 1029\u20131038. ACM (2010). https:\/\/doi.org\/10.1145\/1835804.1835934","DOI":"10.1145\/1835804.1835934"},{"key":"1076_CR3","doi-asserted-by":"publisher","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE International Conference on Data Mining, pp. 88\u201397 (2010). https:\/\/doi.org\/10.1109\/ICDM.2010.118","DOI":"10.1109\/ICDM.2010.118"},{"key":"1076_CR4","doi-asserted-by":"publisher","unstructured":"Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: International Conference on Knowledge Discovery and Data Mining, KDD \u201916, pp. 795\u2013804. ACM, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2939672.2939745","DOI":"10.1145\/2939672.2939745"},{"key":"1076_CR5","unstructured":"Chen, Y., Shioi, H., Montesinos, C.F., Koh, L.P., Wich, S., Krause, A.: Active detection via adaptive submodularity. In: ICML, pp. 55\u201363 (2014)"},{"key":"1076_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Javdani, S., Karbasi, A., Bagnell, J.A., Srinivasa, S.S., Krause, A.: Submodular surrogates for value of information. In: AAAI, pp. 3511\u20133518 (2015)","DOI":"10.1609\/aaai.v29i1.9694"},{"key":"1076_CR7","unstructured":"Gabillon, V., Kveton, B., Wen, Z., Eriksson, B., Muthukrishnan, S.: Adaptive submodular maximization in bandit setting. In: International Conference on Neural Information Processing Systems, NIPS\u201913, pp. 2697\u20132705. Curran Associates Inc., USA (2013). http:\/\/dl.acm.org\/citation.cfm?id=2999792.2999913"},{"key":"1076_CR8","doi-asserted-by":"crossref","unstructured":"Gabillon, V., Kveton, B., Wen, Z., Eriksson, B., Muthukrishnan, S.: Large-scale optimistic adaptive submodularity. In: AAAI, pp. 1816\u20131823 (2014)","DOI":"10.1609\/aaai.v28i1.9003"},{"key":"1076_CR9","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2008.08.022","volume":"198","author":"B Goldengorin","year":"2009","unstructured":"Goldengorin, B.: Maximization of submodular functions: theory and enumeration algorithms. Eur. J. Oper. Res. 198, 102\u2013112 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1076_CR10","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, 427\u2013486 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"1076_CR11","unstructured":"Gotovos, A., Karbasi, A., Krause, A.: Non-monotone adaptive submodular maximization. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"key":"1076_CR12","unstructured":"Hatano, D., Fukunaga, T., Kawarabayashi, K.I.: Adaptive budget allocation for maximizing influence of advertisements. In: IJCAI, pp. 3600\u20133608 (2016)"},{"key":"1076_CR13","doi-asserted-by":"publisher","unstructured":"Horel, T., Singer, Y.: Scalable methods for adaptively seeding a social network. In: International Conference on World Wide Web, WWW \u201915, pp. 441\u2013451 (2015). https:\/\/doi.org\/10.1145\/2736277.2741127","DOI":"10.1145\/2736277.2741127"},{"key":"1076_CR14","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: International Conference on Knowledge Discovery and Data Mining, KDD \u201903, pp. 137\u2013146. ACM (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"issue":"2","key":"1076_CR15","first-page":"8","volume":"35","author":"A Krause","year":"2014","unstructured":"Krause, A., Golovin, D., Converse, S.: Sequential decision making in computational sustainability via adaptive submodularity. Ai Mag. 35(2), 8\u201318 (2014)","journal-title":"Ai Mag."},{"issue":"2","key":"1076_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14778\/2850578.2850581","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endow. 9(2), 60\u201371 (2015). https:\/\/doi.org\/10.14778\/2850578.2850581","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"1076_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177\u2013188 (1978). https:\/\/doi.org\/10.1287\/moor.3.3.177","journal-title":"Math. Oper. Res."},{"key":"1076_CR18","doi-asserted-by":"publisher","unstructured":"Nguyen, H.T., Dinh, T.N., Thai, M.T.: Cost-aware targeted viral marketing in billion-scale networks. In: The 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, pp. 1\u20139 (2016). https:\/\/doi.org\/10.1109\/INFOCOM.2016.7524377","DOI":"10.1109\/INFOCOM.2016.7524377"},{"key":"1076_CR19","doi-asserted-by":"publisher","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: International Conference on Management of Data, SIGMOD \u201916, pp. 695\u2013710. ACM (2016). https:\/\/doi.org\/10.1145\/2882903.2915207","DOI":"10.1145\/2882903.2915207"},{"key":"1076_CR20","doi-asserted-by":"publisher","unstructured":"Seeman, L., Singer, Y.: Adaptive seeding in social networks. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 459\u2013468 (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.56","DOI":"10.1109\/FOCS.2013.56"},{"key":"1076_CR21","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Towards profit maximization for online social network providers. CoRR (2017). arXiv:1712.08963","DOI":"10.1109\/INFOCOM.2018.8485975"},{"key":"1076_CR22","doi-asserted-by":"publisher","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: International Conference on Management of Data, SIGMOD \u201914, pp. 75\u201386. ACM (2014). https:\/\/doi.org\/10.1145\/2588555.2593670","DOI":"10.1145\/2588555.2593670"},{"key":"1076_CR23","doi-asserted-by":"publisher","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201915, pp. 1539\u20131554. ACM (2015). https:\/\/doi.org\/10.1145\/2723372.2723734","DOI":"10.1145\/2723372.2723734"},{"issue":"1","key":"1076_CR24","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2017","unstructured":"Tong, G., Wu, W., Tang, S., Du, D.Z.: Adaptive influence maximization in dynamic social networks. IEEE\/ACM Trans. Netw. 25(1), 112\u2013125 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"1076_CR25","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1007\/s10878-016-9991-1","volume":"31","author":"A Wang","year":"2016","unstructured":"Wang, A., Wu, W., Cui, L.: On Bharathi\u2013Kempe\u2013Salek conjecture for influence maximization on arborescence. J. Comb. Optim. 31(4), 1678\u20131684 (2016)","journal-title":"J. Comb. Optim."},{"issue":"11","key":"1076_CR26","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1109\/TKDE.2017.2740284","volume":"29","author":"Z Wang","year":"2017","unstructured":"Wang, Z., Yang, Y., Pei, J., Chu, L., Chen, E.: Activity maximization by effective information diffusion in social networks. IEEE Trans. Knowl. Data Eng. 29(11), 2374\u20132387 (2017). https:\/\/doi.org\/10.1109\/TKDE.2017.2740284","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12","key":"1076_CR27","doi-asserted-by":"publisher","first-page":"2013","DOI":"10.1109\/TCSVT.2014.2364419","volume":"25","author":"Z Xue","year":"2015","unstructured":"Xue, Z., Wu, D., He, J., Hei, X., Liu, Y.: Playing high-end video games in the cloud: a measurement study. IEEE Trans. Circuits Syst. Video Technol. 25(12), 2013\u20132025 (2015). https:\/\/doi.org\/10.1109\/TCSVT.2014.2364419","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"1076_CR28","doi-asserted-by":"crossref","unstructured":"Yuan, J., Tang, S.J.: Adaptive discount allocation in social networks. In: Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, p. 22. ACM (2017)","DOI":"10.1145\/3084041.3084043"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01076-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01076-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01076-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T21:45:41Z","timestamp":1673214341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01076-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,9]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1076"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01076-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,9,9]]},"assertion":[{"value":"24 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}