{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092510,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93176-6_18","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"200-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fixed Observation Time-Step: Adaptive Influence Maximization"],"prefix":"10.1007","author":[{"given":"Yapu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shengminjie","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Wenqing","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Zhenning","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. SIAM (2014)","key":"18_CR1","DOI":"10.1137\/1.9781611973402.70"},{"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 the AAAI Conference on Artificial Intelligence (2020)","key":"18_CR2","DOI":"10.1609\/aaai.v34i01.5398"},{"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 the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029\u20131038 (2010)","key":"18_CR3","DOI":"10.1145\/1835804.1835934"},{"doi-asserted-by":"crossref","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. IEEE (2010)","key":"18_CR4","DOI":"10.1109\/ICDM.2010.118"},{"doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366. ACM (2001)","key":"18_CR5","DOI":"10.1145\/502512.502525"},{"issue":"1","key":"18_CR6","first-page":"427","volume":"42","author":"D Golovin","year":"2012","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42(1), 427\u2013486 (2012)","journal-title":"J. Artif. Intell. Res."},{"issue":"5","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447396","volume":"15","author":"J Guo","year":"2021","unstructured":"Guo, J., Wu, W.: Adaptive influence maximization: if influential node unwilling to be the seed. ACM Trans. Knowl. Discov. Data (TKDD) 15(5), 1\u201323 (2021)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"6","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1007\/s00778-020-00615-8","volume":"29","author":"K Huang","year":"2020","unstructured":"Huang, K., et al.: Efficient approximation algorithms for adaptive influence maximization. VLDB J. 29(6), 1385\u20131406 (2020). https:\/\/doi.org\/10.1007\/s00778-020-00615-8","journal-title":"VLDB J."},{"doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM (2003)","key":"18_CR9","DOI":"10.1145\/956750.956769"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.peva.2015.06.012","volume":"91","author":"Y Lin","year":"2015","unstructured":"Lin, Y., Lui, J.: Analyzing competitive influence maximization problems with partial information: an approximation algorithmic framework. Perform. Eval. 91, 187\u2013204 (2015)","journal-title":"Perform. Eval."},{"issue":"2","key":"18_CR11","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.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endow. 9(2), 60\u201371 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Nguyen, N.P., Yan, G., Thai, M.T., Eidenbenz, S.: Containment of misinformation spread in online social networks. In: ACM Web Science Conference (2012)","key":"18_CR13","DOI":"10.1145\/2380718.2380746"},{"key":"18_CR14","first-page":"5574","volume":"32","author":"B Peng","year":"2019","unstructured":"Peng, B., Chen, W.: Adaptive influence maximization with myopic feedback. Adv. Neural. Inf. Process. Syst. 32, 5574\u20135583 (2019)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370. ACM (2002)","key":"18_CR15","DOI":"10.1145\/775047.775057"},{"doi-asserted-by":"crossref","unstructured":"Salha, G., Tziortziotis, N., Vazirgiannis, M.: Adaptive submodular influence maximization with myopic feedback (2017)","key":"18_CR16","DOI":"10.1109\/ASONAM.2018.8508254"},{"doi-asserted-by":"crossref","unstructured":"Sun, L., Huang, W., Yu, P.S., Wei, C.: Multi-round influence maximization. In: the 24th ACM SIGKDD International Conference (2018)","key":"18_CR17","DOI":"10.1145\/3219819.3220101"},{"doi-asserted-by":"publisher","unstructured":"Tang, J., et al.: Efficient approximation algorithms for adaptive seed minimization. In: Proceedings of the 2019 International Conference on Management of Data, SIGMOD 2019, New York, NY, USA, pp. 1096\u20131113. Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3299869.3319881","key":"18_CR18","DOI":"10.1145\/3299869.3319881"},{"doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Xiao, X., Yuan, J.: Online processing algorithms for influence maximization. In: Proceedings of the 2018 International Conference on Management of Data, pp. 991\u20131005 (2018)","key":"18_CR19","DOI":"10.1145\/3183713.3183749"},{"doi-asserted-by":"crossref","unstructured":"Tang, S., Tong, G., Wu, W., Du, D.Z.: Adaptive influence maximization in dynamic social networks. In: IEEE\/ACM Transactions on Networking: A Joint Publication of the IEEE Communications Society, the IEEE Computer Society, and the ACM with Its Special Interest Group on Data Communication (2017)","key":"18_CR20","DOI":"10.1109\/TNET.2016.2563397"},{"doi-asserted-by":"crossref","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, pp. 1539\u20131554. ACM (2015)","key":"18_CR21","DOI":"10.1145\/2723372.2723734"},{"doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386. ACM (2014)","key":"18_CR22","DOI":"10.1145\/2588555.2593670"},{"unstructured":"Tong, A., Du, D.Z., Wu, W.: On misinformation containment in online social networks. In: Advances in Neural Information Processing Systems, pp. 341\u2013351 (2018)","key":"18_CR23"},{"unstructured":"Vaswani, S., Lakshmanan, L.V.: Adaptive influence maximization in social networks: why commit when you can adapt? arXiv preprint arXiv:1604.08171 (2016)","key":"18_CR24"},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2021.02.014","volume":"861","author":"Y Zhang","year":"2021","unstructured":"Zhang, Y., Yang, W., Du, D.Z.: Rumor correction maximization problem in social networks. Theoret. Comput. Sci. 861(1), 102\u2013116 (2021)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93176-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:45:23Z","timestamp":1641015923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}