{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:11:40Z","timestamp":1787011900937,"version":"build-2736575974"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/asonam.2018.8508254","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T19:19:29Z","timestamp":1540495169000},"page":"455-462","source":"Crossref","is-referenced-by-count":12,"title":["Adaptive Submodular Influence Maximization with Myopic Feedback"],"prefix":"10.1109","author":[{"given":"Guillaume","family":"Salha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaos","family":"Tziortziotis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michalis","family":"Vazirgiannis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939760"},{"key":"ref11","article-title":"Going viral: Optimizing discount allocation in social networks for influence maximization","author":"tang","year":"2016","journal-title":"CoRR vol abs\/1606 07916"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref13","article-title":"MATI: An Efficient Algorithm for Influence Maximization in Social Networks","author":"rossi","year":"2017","journal-title":"Complex Networks 2017 – 6th International Conference on Complex Networks and Their Applications"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.79"},{"key":"ref18","first-page":"266","article-title":"Scalable and parallelizable processing of influence maximization for large-scale social networks?","author":"kim","year":"2013","journal-title":"ICDM"},{"key":"ref19","first-page":"427","article-title":"Adaptive submodularity: Theory and applications in active learning and stochastic optimization","volume":"42","author":"golovin","year":"2011","journal-title":"JAIR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref6","article-title":"Submodularity and curvature: The optimal algorithm","volume":"b23","author":"vondrak","year":"2010","journal-title":"RIMS Kokyuroku Bessatsu"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487649"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835935"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref9","article-title":"Online topic-aware influence maximization queries","author":"aslay","year":"2014","journal-title":"EDBT"},{"key":"ref20","article-title":"Multi-round influence maximization (extended version)","author":"sun","year":"2018","journal-title":"CoRR"},{"key":"ref22","article-title":"Adaptive influence maximization in social networks: Why commit when you can adapt?","volume":"abs 1604 8171","author":"vaswani","year":"2016","journal-title":"CoRR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/546"},{"key":"ref24","article-title":"Non-monotone adaptive submodular maximization","author":"gotovos","year":"2015","journal-title":"IJCAI"},{"key":"ref23","author":"leskovec","year":"2014","journal-title":"SNAP Datasets Stanford large network dataset collection"}],"event":{"name":"2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","location":"Barcelona","start":{"date-parts":[[2018,8,28]]},"end":{"date-parts":[[2018,8,31]]}},"container-title":["2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8488381\/8508239\/08508254.pdf?arnumber=8508254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T12:45:56Z","timestamp":1643201156000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8508254\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/asonam.2018.8508254","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}