{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T18:30:37Z","timestamp":1775932237373,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore Ministry of Education","award":["MOE2017-T1-002-024 and MOE2015-T2-2-069"],"award-info":[{"award-number":["MOE2017-T1-002-024 and MOE2015-T2-2-069"]}]},{"name":"National University of Singapore","award":["SUG"],"award-info":[{"award-number":["SUG"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3183749","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"991-1005","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":144,"title":["Online Processing Algorithms for Influence Maximization"],"prefix":"10.1145","author":[{"given":"Jing","family":"Tang","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Junsong","family":"Yuan","sequence":"additional","affiliation":[{"name":"State University of New York at Buffalo, Buffalo, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035924"},{"key":"e_1_3_2_1_2_1","volume-title":"Maximizing Social Influence in Nearly Optimal Time Proc. SODA. 946--957","author":"Borgs Christian","year":"2014","unstructured":"Christian Borgs , Michael Brautbar , Jennifer Chayes , and Brendan Lucier . 2014 . Maximizing Social Influence in Nearly Optimal Time Proc. SODA. 946--957 . Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing Social Influence in Nearly Optimal Time Proc. SODA. 946--957."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735706"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609592"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505541"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662077"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882929"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742725"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304208"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099623"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2580063"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783271"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_1_25_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (2014).  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (2014)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794376"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"e_1_3_2_1_29_1","volume-title":"Dinh","author":"Nguyen Hung T.","year":"2017","unstructured":"Hung T. Nguyen , My T. Thai , and Thang N . Dinh . 22 Feb 2017 . Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-Scale Networks . arXiv preprint, https:\/\/arxiv.org\/abs\/1605.07990v3. (. 22 Feb 2017). Hung T. Nguyen, My T. Thai, and Thang N. Dinh. 22 Feb 2017. Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-Scale Networks. arXiv preprint, https:\/\/arxiv.org\/abs\/1605.07990v3. (. 22 Feb 2017)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2893873.2893897"},{"key":"e_1_3_2_1_31_1","volume-title":"Facebook and Google Are Big Winners as Political Ad Money Moves Online. Fortune","author":"Roberts Jeff John","year":"2016","unstructured":"Jeff John Roberts . 2016. Facebook and Google Are Big Winners as Political Ad Money Moves Online. Fortune ( 2016 ). Jeff John Roberts. 2016. Facebook and Google Are Big Winners as Political Ad Money Moves Online. Fortune (2016)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2320515"},{"key":"e_1_3_2_1_33_1","volume-title":"Profit Maximization for Viral Marketing in Online Social Networks Proc. IEEE ICNP. 1--10","author":"Tang Jing","year":"2016","unstructured":"Jing Tang , Xueyan Tang , and Junsong Yuan . 2016 . Profit Maximization for Viral Marketing in Online Social Networks Proc. IEEE ICNP. 1--10 . Jing Tang, Xueyan Tang, and Junsong Yuan. 2016. Profit Maximization for Viral Marketing in Online Social Networks Proc. IEEE ICNP. 1--10."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110025.3110041"},{"key":"e_1_3_2_1_35_1","volume-title":"2018 a. An Efficient and Effective Hop-Based Approach for Inluence Maximization in Social Networks. Social Network Analysis and Mining","author":"Tang Jing","year":"2018","unstructured":"Jing Tang , Xueyan Tang , and Junsong Yuan . 2018 a. An Efficient and Effective Hop-Based Approach for Inluence Maximization in Social Networks. Social Network Analysis and Mining Vol. 8 , 10 ( 2018 ). Jing Tang, Xueyan Tang, and Junsong Yuan. 2018 a. An Efficient and Effective Hop-Based Approach for Inluence Maximization in Social Networks. Social Network Analysis and Mining Vol. 8, 10 (2018)."},{"key":"e_1_3_2_1_36_1","volume-title":"2018 b. Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis","author":"Tang Jing","year":"2018","unstructured":"Jing Tang , Xueyan Tang , and Junsong Yuan . 2018 b. Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis . IEEE Transactions on Knowledge and Data Engineering ( 2018 ). Jing Tang, Xueyan Tang, and Junsong Yuan. 2018 b. Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis. IEEE Transactions on Knowledge and Data Engineering (2018)."},{"key":"e_1_3_2_1_37_1","volume-title":"Towards Profit Maximization for Online Social Network Providers Proc. IEEE INFOCOM. 1178--1186","author":"Tang Jing","year":"2018","unstructured":"Jing Tang , Xueyan Tang , and Junsong Yuan . 2018 c . Towards Profit Maximization for Online Social Network Providers Proc. IEEE INFOCOM. 1178--1186 . Jing Tang, Xueyan Tang, and Junsong Yuan. 2018 c. Towards Profit Maximization for Online Social Network Providers Proc. IEEE INFOCOM. 1178--1186."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_3_2_1_40_1","volume-title":"Approximation Algorithms","author":"Vazirani Vijay V.","unstructured":"Vijay V. Vazirani . 2003. Approximation Algorithms . Springer . Vijay V. Vazirani. 2003. Approximation Algorithms. Springer."},{"key":"e_1_3_2_1_41_1","volume-title":"Sequential Analysis","author":"Wald Abraham","unstructured":"Abraham Wald . 1947. Sequential Analysis . Wiley . Abraham Wald. 1947. Sequential Analysis. Wiley."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355749"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067429"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577336"},{"key":"e_1_3_2_1_45_1","volume-title":"UBLF: An Upper Bound Based Approach to Discover Influential Nodes in Social Networks Proc","author":"Zhou Chuan","year":"2013","unstructured":"Chuan Zhou , Peng Zhang , Jing Guo , Xingquan Zhu , and Li Guo . 2013 . UBLF: An Upper Bound Based Approach to Discover Influential Nodes in Social Networks Proc . IEEE ICDM. 907--916. Chuan Zhou, Peng Zhang, Jing Guo, Xingquan Zhu, and Li Guo. 2013. UBLF: An Upper Bound Based Approach to Discover Influential Nodes in Social Networks Proc. IEEE ICDM. 907--916."}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3183749","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3183749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:38:04Z","timestamp":1750282684000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3183749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":45,"alternative-id":["10.1145\/3183713.3183749","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3183749","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}