{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T16:40:57Z","timestamp":1786120857857,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":88,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:00:00Z","timestamp":1786147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,8,9]]},"DOI":"10.1145\/3770855.3817696","type":"proceedings-article","created":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T17:15:47Z","timestamp":1786036547000},"page":"6512-6523","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["One Rounding Fits All: Memory-Efficient Approximation Algorithms for Partition-Constrained Influence Maximization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0535-3134","authenticated-orcid":false,"given":"Qixin","family":"Zhang","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0570-532X","authenticated-orcid":false,"given":"Qirun","family":"Zeng","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9009-0315","authenticated-orcid":false,"given":"Hui","family":"Lu","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7680-2817","authenticated-orcid":false,"given":"Pingchuan","family":"Ma","sequence":"additional","affiliation":[{"name":"Zhejiang University of Technology, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9557-3551","authenticated-orcid":false,"given":"Jinhang","family":"Zuo","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8313-9835","authenticated-orcid":false,"given":"Renqiang","family":"Luo","sequence":"additional","affiliation":[{"name":"Jilin University, Chang Chun, Ji Lin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2730-9553","authenticated-orcid":false,"given":"Yi","family":"Yu","sequence":"additional","affiliation":[{"name":"College of Communication Engineering, Jilin University, Changchun, Jilin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7225-5449","authenticated-orcid":false,"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02199-z"},{"key":"e_1_3_2_1_2_1","volume-title":"V27, 3","author":"Ahn Miju","year":"2017","unstructured":"Miju Ahn, Jong-Shi Pang, and Jack Xin. 2017. Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM Journal on Optimization, V27, 3 (2017), 1637-1665."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137635"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Francis Bach et al. 2013. Learning with submodular functions: A convex optimization perspective. Foundations and Trends\u00ae in machine learning V6 2-3 (2013) 145-373.","DOI":"10.1561\/2200000039"},{"key":"e_1_3_2_1_5_1","first-page":"100","article-title":"Influence Maximization With Co-Existing Seeds","author":"Becker Ruben","year":"2021","unstructured":"Ruben Becker, Gianlorenzo d'Angelo, and Hugo Gilbert. 2021. Influence Maximization With Co-Existing Seeds. In CIKM. 100-109.","journal-title":"CIKM."},{"key":"e_1_3_2_1_6_1","first-page":"111","article-title":"Guaranteed non-convex optimization: Submodular maximization over continuous domains","author":"Bian Andrew An","year":"2017","unstructured":"Andrew An Bian, Baharan Mirzasoleiman, Joachim Buhmann, and Andreas Krause. 2017. Guaranteed non-convex optimization: Submodular maximization over continuous domains. In Artificial Intelligence and Statistics. PMLR, 111-120.","journal-title":"Artificial Intelligence and Statistics. PMLR"},{"key":"e_1_3_2_1_7_1","first-page":"946","article-title":"Maximizing social influence in nearly optimal time","author":"Borgs Christian","year":"2014","unstructured":"Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In SODA. 946-957.","journal-title":"SODA."},{"key":"e_1_3_2_1_8_1","volume-title":"Summer school on machine learning","author":"Boucheron St\u00e9phane","unstructured":"St\u00e9phane Boucheron, G\u00e1bor Lugosi, and Olivier Bousquet. 2003. Concentration inequalities. In Summer school on machine learning. Springer, 208-240."},{"key":"e_1_3_2_1_9_1","volume-title":"V14, 64","author":"Boucheron S","year":"2009","unstructured":"S Boucheron, G Lugosi, and P Massart. 2009. On concentration of self-bounding functions. Electronic Journal of Probability, V14, 64 (2009), 1884-1899."},{"key":"e_1_3_2_1_10_1","volume-title":"V44, 3","author":"Buchbinder Niv","year":"2019","unstructured":"Niv Buchbinder and Moran Feldman. 2019. Constrained submodular maximization via a nonsymmetric technique. Mathematics of Operations Research, V44, 3 (2019), 988-1005."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649630"},{"key":"e_1_3_2_1_12_1","volume-title":"V42, 2","author":"Buchbinder Niv","year":"2017","unstructured":"Niv Buchbinder, Moran Feldman, and Roy Schwartz. 2017. Comparing apples and oranges: Query trade-off in submodular maximization. Mathematics of Operations Research, V42, 2 (2017), 308-329."},{"key":"e_1_3_2_1_13_1","first-page":"665","article-title":"Limiting the spread of misinformation in social networks","author":"Budak Ceren","year":"2011","unstructured":"Ceren Budak, Divyakant Agrawal, and Amr El Abbadi. 2011. Limiting the spread of misinformation in social networks. In WWW. 665-674.","journal-title":"WWW."},{"key":"e_1_3_2_1_14_1","first-page":"182","article-title":"Maximizing a Submodular Set Function Subject to a Matroid Constraint","author":"Calinescu Gruia","year":"2007","unstructured":"Gruia Calinescu, Chandra Chekuri, Martin P\u00e1l, and Jan Vondr\u00e1k. 2007. Maximizing a Submodular Set Function Subject to a Matroid Constraint. In IPCO. 182-196.","journal-title":"IPCO."},{"key":"e_1_3_2_1_15_1","volume-title":"V40, 6","author":"Calinescu Gruia","year":"2011","unstructured":"Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondr\u00e1k. 2011. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput., V40, 6 (2011), 1740-1766."},{"key":"e_1_3_2_1_16_1","volume-title":"International Workshop on Frontiers in Algorithmics. 37-48","author":"Hubert Chan T-H","year":"2020","unstructured":"T-H Hubert Chan, Li Ning, and Yong Zhang. 2020. Influence maximization under the non-progressive linear threshold model. In International Workshop on Frontiers in Algorithmics. 37-48."},{"key":"e_1_3_2_1_17_1","first-page":"575","article-title":"Dependent randomized rounding via exchange properties of combinatorial structures","author":"Chekuri Chandra","year":"2010","unstructured":"Chandra Chekuri, Jan Vondr\u00e1k, and Rico Zenklusen. 2010. Dependent randomized rounding via exchange properties of combinatorial structures. In FOCS. 575-584.","journal-title":"FOCS."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993740"},{"key":"e_1_3_2_1_19_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR","author":"Chen Lin","year":"2018","unstructured":"Lin Chen, Hamed Hassani, and Amin Karbasi. 2018. Online continuous submodular maximization. In International Conference on Artificial Intelligence and Statistics. PMLR, 1896-1905."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01850-3"},{"key":"e_1_3_2_1_21_1","first-page":"1029","article-title":"Scalable influence maximization for prevalent viral marketing in large-scale social networks","author":"Chen Wei","year":"2010","unstructured":"Wei Chen, Chi Wang, and Yajun Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In SIGKDD. 1029-1038.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2020.2998777"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511618796"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487639"},{"key":"e_1_3_2_1_25_1","first-page":"57","article-title":"Mining the network value of customers","author":"Domingos Pedro","year":"2001","unstructured":"Pedro Domingos and Matt Richardson. 2001. Mining the network value of customers. In SIGKDD. 57-66.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_26_1","first-page":"1","article-title":"Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks. J. Mach","volume":"18","author":"Du Nan","year":"2017","unstructured":"Nan Du, Yingyu Liang, Maria-Florina Balcan, Manuel Gomez-Rodriguez, Hongyuan Zha, and Le Song. 2017. Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks. J. Mach. Learn. Res., V18, 2 (2017), 1-45.","journal-title":"Learn. Res."},{"key":"e_1_3_2_1_27_1","first-page":"13609","article-title":"Fairness in Streaming Submodular Maximization","author":"Halabi Marwa El","year":"2020","unstructured":"Marwa El Halabi, Slobodan Mitrovi\u00e7, Ashkan Norouzi-Fard, Jakab Tardos, and Jakub M Tarnawski. 2020. Fairness in Streaming Submodular Maximization: Algorithms and Hardness. In NeurIPS. 13609-13622.","journal-title":"Algorithms and Hardness. In NeurIPS."},{"key":"e_1_3_2_1_28_1","unstructured":"Ocean Engine. 2023. China Influencer Marketing with Douyin and Xingtu. https:\/\/www.oceanengine.io\/resource\/china-influencer-marketing-douyin-xingtu-tips-strategies."},{"key":"e_1_3_2_1_29_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 3427-3439","author":"Faust Oisin","year":"2023","unstructured":"Oisin Faust, Hamza Fawzi, and James Saunderson. 2023. A Bregman divergence view on the difference-of-convex algorithm. In International Conference on Artificial Intelligence and Statistics. PMLR, 3427-3439."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_31_1","first-page":"570","article-title":"A unified continuous greedy algorithm for submodular maximization. In 2011 IEEE 52nd annual symposium on foundations of computer science","author":"Feldman Moran","year":"2011","unstructured":"Moran Feldman, Joseph Naor, and Roy Schwartz. 2011. A unified continuous greedy algorithm for submodular maximization. In 2011 IEEE 52nd annual symposium on foundations of computer science. IEEE, 570-579.","journal-title":"IEEE"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Marshall L Fisher George L Nemhauser and Laurence A Wolsey. 1978. An analysis of approximations for maximizing submodular set functions\u2014II. In Polyhedral combinatorics. 73-87.","DOI":"10.1007\/BFb0121195"},{"key":"e_1_3_2_1_33_1","volume-title":"Submodular functions and optimization","author":"Fujishige Satoru","unstructured":"Satoru Fujishige. 2005. Submodular functions and optimization. Vol. V58. Elsevier."},{"key":"e_1_3_2_1_34_1","volume-title":"V12, 3","author":"Goldenberg Jacob","year":"2001","unstructured":"Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters, V12, 3 (2001), 211-223."},{"key":"e_1_3_2_1_35_1","volume-title":"V83, 6","author":"Granovetter Mark","year":"1978","unstructured":"Mark Granovetter. 1978. Threshold models of collective behavior. American journal of sociology, V83, 6 (1978), 1420-1443."},{"key":"e_1_3_2_1_36_1","first-page":"2167","article-title":"Influence maximization revisited: Efficient reverse reachable set generation with bound tightened","author":"Guo Qintian","year":"2020","unstructured":"Qintian Guo, Sibo Wang, Zhewei Wei, and Ming Chen. 2020. Influence maximization revisited: Efficient reverse reachable set generation with bound tightened. In SIGMOD. 2167-2181.","journal-title":"SIGMOD."},{"key":"e_1_3_2_1_37_1","volume-title":"V47, 3","author":"Guo Qintian","year":"2022","unstructured":"Qintian Guo, Sibo Wang, Zhewei Wei, Wenqing Lin, and Jing Tang. 2022. Influence Maximization Revisited: Efficient Sampling with Bound Tightened. ACM Transactions on Database Systems, V47, 3 (2022)."},{"key":"e_1_3_2_1_38_1","first-page":"671","article-title":"Efficient and effective algorithms for revenue maximization in social advertising","author":"Han Kai","year":"2021","unstructured":"Kai Han, Benwei Wu, Jing Tang, Shuang Cui, Cigdem Aslay, and Laks VS Lakshmanan. 2021. Efficient and effective algorithms for revenue maximization in social advertising. In SIGMOD. 671-684.","journal-title":"SIGMOD."},{"key":"e_1_3_2_1_39_1","volume-title":"V30, 4","author":"Hassani Hamed","year":"2020","unstructured":"Hamed Hassani, Amin Karbasi, Aryan Mokhtari, and Zebang Shen. 2020. Stochastic conditional gradient:(non) convex minimization and continuous submodular maximization. SIAM Journal on Optimization, V30, 4 (2020), 3315-3344."},{"key":"e_1_3_2_1_40_1","volume-title":"V30","author":"Hassani Hamed","year":"2017","unstructured":"Hamed Hassani, Mahdi Soltanolkotabi, and Amin Karbasi. 2017. Gradient methods for submodular maximization. Advances in Neural Information Processing Systems, V30 (2017)."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.40"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3705829.3705833"},{"key":"e_1_3_2_1_43_1","unstructured":"Instagram. 2022. Introducing Creator Marketplace Where Brands Can Discover Creators to Collaborate With. https:\/\/business.instagram.com\/blog\/creator-marketplace-discover-partnerships."},{"key":"e_1_3_2_1_44_1","volume-title":"Christophe Van den Bulte, and Thomas W Valente","author":"Iyengar Raghuram","year":"2011","unstructured":"Raghuram Iyengar, Christophe Van den Bulte, and Thomas W Valente. 2011. Opinion leadership and social contagion in new product diffusion. Marketing science, V30, 2 (2011), 195-212."},{"key":"e_1_3_2_1_45_1","volume-title":"V30","author":"Karimi Mohammad","year":"2017","unstructured":"Mohammad Karimi, Mario Lucic, Hamed Hassani, and Andreas Krause. 2017. Stochastic submodular maximization: The case of coverage functions. NeurIPS, V30 (2017)."},{"key":"e_1_3_2_1_46_1","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe David","year":"2003","unstructured":"David Kempe, Jon Kleinberg, and \u00c9va Tardos. 2003. Maximizing the spread of influence through a social network. In SIGKDD. 137-146.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1235-y"},{"key":"e_1_3_2_1_48_1","first-page":"420","article-title":"Cost-effective outbreak detection in networks","author":"Leskovec Jure","year":"2007","unstructured":"Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. 2007. Cost-effective outbreak detection in networks. In SIGKDD. 420-429.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_49_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_50_1","first-page":"1884","article-title":"Automated influence maintenance in social networks: an agent-based approach","volume":"31","author":"Li Weihua","year":"2018","unstructured":"Weihua Li, Quan Bai, Minjie Zhang, and Tung Doan Nguyen. 2018a. Automated influence maintenance in social networks: an agent-based approach. IEEE Transactions on Knowledge and Data Engineering, V31, 10 (2018), 1884-1897.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589309"},{"key":"e_1_3_2_1_53_1","volume-title":"International conference on machine learning. PMLR, 3616-3625","author":"Mokhtari Aryan","year":"2018","unstructured":"Aryan Mokhtari, Hamed Hassani, and Amin Karbasi. 2018. Decentralized submodular maximization: Bridging discrete and continuous settings. In International conference on machine learning. PMLR, 3616-3625."},{"key":"e_1_3_2_1_54_1","first-page":"1","article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","volume":"21","author":"Mokhtari Aryan","year":"2020","unstructured":"Aryan Mokhtari, Hamed Hassani, and Amin Karbasi. 2020. Stochastic conditional gradient methods: From convex minimization to submodular maximization. Journal of machine learning research, V21, 105 (2020), 1-49.","journal-title":"Journal of machine learning research"},{"key":"e_1_3_2_1_55_1","volume-title":"V24, 2","author":"Natarajan Balas Kausik","year":"1995","unstructured":"Balas Kausik Natarajan. 1995. Sparse approximate solutions to linear systems. SIAM journal on computing, V24, 2 (1995), 227-234."},{"key":"e_1_3_2_1_56_1","volume-title":"V14","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions\u2014I. Mathematical programming, V14 (1978), 265-294."},{"key":"e_1_3_2_1_57_1","volume-title":"V44","author":"Oneto Luca","year":"2013","unstructured":"Luca Oneto, Alessandro Ghio, Davide Anguita, and Sandro Ridella. 2013. An improved analysis of the Rademacher data-dependent bound using its self bounding property. Neural Networks, V44 (2013), 107-111."},{"key":"e_1_3_2_1_58_1","volume-title":"Sharper convergence bounds of monte carlo rademacher averages through self-bounding functions. arXiv preprint arXiv:2010.12103","author":"Pellegrina Leonardo","year":"2020","unstructured":"Leonardo Pellegrina. 2020. Sharper convergence bounds of monte carlo rademacher averages through self-bounding functions. arXiv preprint arXiv:2010.12103 (2020)."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599325"},{"key":"e_1_3_2_1_60_1","first-page":"61","article-title":"Mining knowledge-sharing sites for viral marketing","author":"Richardson Matthew","year":"2002","unstructured":"Matthew Richardson and Pedro Domingos. 2002. Mining knowledge-sharing sites for viral marketing. In SIGKDD. 61-70.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783265"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.14778\/3547305.3547324"},{"key":"e_1_3_2_1_63_1","first-page":"2249","article-title":"Multi-round influence maximization","author":"Sun Lichao","year":"2018","unstructured":"Lichao Sun, Weiran Huang, Philip S Yu, and Wei Chen. 2018. Multi-round influence maximization. In SIGKDD. 2249-2258.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_64_1","first-page":"760","article-title":"Scalable Adversarial Attack Algorithms on Influence Maximization","author":"Sun Lichao","year":"2023","unstructured":"Lichao Sun, Xiaobin Rui, and Wei Chen. 2023. Scalable Adversarial Attack Algorithms on Influence Maximization. In WSDM. 760-768.","journal-title":"WSDM."},{"key":"e_1_3_2_1_65_1","first-page":"991","article-title":"Online processing algorithms for influence maximization","author":"Tang Jing","year":"2018","unstructured":"Jing Tang, Xueyan Tang, Xiaokui Xiao, and Junsong Yuan. 2018. Online processing algorithms for influence maximization. In SIGMOD. 991-1005.","journal-title":"SIGMOD."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11306"},{"key":"e_1_3_2_1_67_1","first-page":"1539","article-title":"Influence maximization in near-linear time: A martingale approach","author":"Tang Youze","year":"2015","unstructured":"Youze Tang, Yanchen Shi, and Xiaokui Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In SIGMOD. 1539-1554.","journal-title":"SIGMOD."},{"key":"e_1_3_2_1_68_1","first-page":"75","article-title":"Influence maximization: Near-optimal time complexity meets practical efficiency","author":"Tang Youze","year":"2014","unstructured":"Youze Tang, Xiaokui Xiao, and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In SIGMOD. 75-86.","journal-title":"SIGMOD."},{"key":"e_1_3_2_1_69_1","unstructured":"Tiktok. 2023. 5 ways TikTok Creator Marketplace makes creator marketing easy. https:\/\/www.tiktok.com\/business\/en-US\/blog\/making-creator-marketing-easy\/."},{"key":"e_1_3_2_1_70_1","volume-title":"NeurIPS","volume":"31","author":"Tong Amo","year":"2018","unstructured":"Amo Tong, Ding-Zhu Du, and Weili Wu. 2018. On Misinformation Containment in Online Social Networks. In NeurIPS, Vol. V31."},{"key":"e_1_3_2_1_71_1","volume-title":"The nature of statistical learning theory","author":"Vapnik Vladimir","unstructured":"Vladimir Vapnik. 2013. The nature of statistical learning theory. Springer science & business media."},{"key":"e_1_3_2_1_72_1","volume-title":"2026 a. Data-efficient biomedical in-context learning: A diversity-enhanced submodular perspective. npj Artificial Intelligence","author":"Wang Jun","year":"2026","unstructured":"Jun Wang, Zaifu Zhan, Qixin Zhang, Mingquan Lin, Meijia Song, and Rui Zhang. 2026 a. Data-efficient biomedical in-context learning: A diversity-enhanced submodular perspective. npj Artificial Intelligence (2026)."},{"key":"e_1_3_2_1_73_1","volume-title":"2026 b. Personalized Lattice Influence Maximization: Approximation Guarantees and Robustness","author":"Wang Jun","year":"2026","unstructured":"Jun Wang, Qixin Zhang, Hongbin Zhang, and Yu Yang. 2026 b. Personalized Lattice Influence Maximization: Approximation Guarantees and Robustness. IEEE Transactions on Network Science and Engineering (2026)."},{"key":"e_1_3_2_1_74_1","volume-title":"International Conference on Machine Learning. PMLR, 23055-23077","author":"Wang Qi","year":"2022","unstructured":"Qi Wang and Herke Van Hoof. 2022. Model-based meta reinforcement learning using graph structured surrogate models and amortized policy search. In International Conference on Machine Learning. PMLR, 23055-23077."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.65109\/UFQF2407"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/761"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1109\/TKDE.2019.2934447","article-title":"Influence analysis in evolving networks: A survey","volume":"33","author":"Yang Yu","year":"2019","unstructured":"Yu Yang and Jian Pei. 2019. Influence analysis in evolving networks: A survey. IEEE Transactions on Knowledge and Data Engineering, V33, 3 (2019), 1045-1063.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01888-3"},{"key":"e_1_3_2_1_79_1","volume-title":"McDiarmid's inequalities of Bernstein and Bennett forms","author":"Ying Yiming","year":"2004","unstructured":"Yiming Ying. 2004. McDiarmid's inequalities of Bernstein and Bennett forms. City University of Hong Kong (2004), 318."},{"key":"e_1_3_2_1_80_1","volume-title":"V32","author":"Zhang Mingrui","year":"2019","unstructured":"Mingrui Zhang, Lin Chen, Hamed Hassani, and Amin Karbasi. 2019. Online continuous submodular maximization: From full-information to bandit feedback. Advances in Neural Information Processing Systems, V32 (2019)."},{"key":"e_1_3_2_1_81_1","volume-title":"International Conference on Machine Learning. PMLR, 26116-26134","author":"Zhang Qixin","year":"2022","unstructured":"Qixin Zhang, Zengde Deng, Zaiyi Chen, Haoyuan Hu, and Yu Yang. 2022. Stochastic continuous submodular maximization: Boosting via non-oblivious function. In International Conference on Machine Learning. PMLR, 26116-26134."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614817"},{"key":"e_1_3_2_1_83_1","volume-title":"Forty-second International Conference on Machine Learning.","author":"Zhang Qixin","year":"2025","unstructured":"Qixin Zhang, Wei Huang, Can Jin, Puning Zhao, Yao Shu, Li Shen, and Dacheng Tao. 2025. Multinoulli Extension: A Lossless Yet Effective Probabilistic Framework for Subset Selection over Partition Constraints. In Forty-second International Conference on Machine Learning."},{"key":"e_1_3_2_1_84_1","volume-title":"Boosting gradient ascent for continuous dr-submodular maximization. arXiv preprint arXiv:2401.08330","author":"Zhang Qixin","year":"2024","unstructured":"Qixin Zhang, Zongqi Wan, Zengde Deng, Zaiyi Chen, Xiaoming Sun, Jialin Zhang, and Yu Yang. 2024. Boosting gradient ascent for continuous dr-submodular maximization. arXiv preprint arXiv:2401.08330 (2024)."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"crossref","unstructured":"Shiqi Zhang Yiqian Huang Jiachen Sun Wenqing Lin Xiaokui Xiao and Bo Tang. 2023b. Capacity Constrained Influence Maximization in Social Networks. In SIGKDD. 3376\u20133385.","DOI":"10.1145\/3580305.3599267"},{"key":"e_1_3_2_1_86_1","volume-title":"V102","author":"Zhang Shiqi","year":"2021","unstructured":"Shiqi Zhang, Xinxun Zeng, and Bo Tang. 2021. RCELF: a residual-based approach for influence maximization problem. Information Systems, V102 (2021), 101828."},{"key":"e_1_3_2_1_87_1","first-page":"1","article-title":"Projection-free decentralized online learning for submodular maximization over time-varying networks","volume":"22","author":"Zhu Junlong","year":"2021","unstructured":"Junlong Zhu, Qingtao Wu, Mingchuan Zhang, Ruijuan Zheng, and Keqin Li. 2021. Projection-free decentralized online learning for submodular maximization over time-varying networks. Journal of Machine Learning Research, V22, 51 (2021), 1-42.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401961"}],"event":{"name":"KDD '26: The 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Jeju Island Republic of Korea","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:23:13Z","timestamp":1786065793000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3770855.3817696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,8]]},"references-count":88,"alternative-id":["10.1145\/3770855.3817696","10.1145\/3770855"],"URL":"https:\/\/doi.org\/10.1145\/3770855.3817696","relation":{},"subject":[],"published":{"date-parts":[[2026,8,8]]},"assertion":[{"value":"2026-08-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}