{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:26:03Z","timestamp":1765974363482,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8485975","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T14:45:36Z","timestamp":1539873936000},"page":"1178-1186","source":"Crossref","is-referenced-by-count":29,"title":["Towards Profit Maximization for Online Social Network Providers"],"prefix":"10.1109","author":[{"given":"Jing","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junsong","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"journal-title":"Towards profit maximization for online social network providers","year":"2017","author":"tang","key":"ref32"},{"key":"ref31","article-title":"Profit maximization for viral marketing in online social networks: Algorithms and analysis","author":"tang","year":"2017","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3110025.3110041"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.40"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.55"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"ref10","first-page":"3147","article-title":"Scalable influence estimation in continuous-time diffusion networks","author":"du","year":"2013","journal-title":"Proc NIPS"},{"key":"ref11","volume":"58","author":"fujishige","year":"2005","journal-title":"Submodular Functions and Optimization"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"ref13","first-page":"407","article-title":"Algorithms for approximate minimization of the difference between submodular functions, with applications","author":"iyer","year":"2012","journal-title":"Proc UAI"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498227"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.145"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183749"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735706"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2320515"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745853"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2016.7784445"},{"key":"ref5","first-page":"592","article-title":"Time-critical influence maximization in social networks with time-delayed diffusion process","author":"chen","year":"2012","journal-title":"Proc AAAI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.122"},{"journal-title":"Viral video marketing What's why's & how's of going viral","year":"2015","author":"meyer","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524377"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref24","first-page":"138","article-title":"Fast and accurate influence maximization on large networks with pruned montecarlo simulations","author":"ohsaka","year":"2014","journal-title":"Proc AAAI"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"ref26","first-page":"561","article-title":"Uncovering the temporal dynamics of diffusion networks","author":"rodriguez","year":"2011","journal-title":"Proc ICML"},{"key":"ref25","article-title":"Facebook and Google are big winners as political ad money moves online","author":"roberts","year":"2016","journal-title":"Fortune"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","start":{"date-parts":[[2018,4,16]]},"location":"Honolulu, HI","end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08485975.pdf?arnumber=8485975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T01:15:10Z","timestamp":1598231710000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8485975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8485975","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}