{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:19:57Z","timestamp":1773883197589,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infcomw.2019.8845129","type":"proceedings-article","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T02:23:05Z","timestamp":1569291785000},"page":"360-364","source":"Crossref","is-referenced-by-count":8,"title":["A Fast Greedy Algorithm for Finding Minimum Positive Influence Dominating Sets in Social Networks"],"prefix":"10.1109","author":[{"given":"Jiehui","family":"Pan","sequence":"first","affiliation":[{"name":"School of Computer Science and Software Engineering, East China Normal University, Shanghai, PR China"}]},{"given":"Tian-Ming","family":"Bu","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, PR China"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"The state of the internet in q4 2018","author":"KEMP","year":"2018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02026-1_29"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.10.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-011-0033-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.51"},{"issue":"3","key":"ref6","first-page":"59","article-title":"An improved algorithm for finding minimum positive influence dominating sets in social networks","volume":"48","author":"Mai","year":"2016","journal-title":"Journal of South China Normal University (Natural Science Edition)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2018.8406851"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.02.119"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-0987-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9530-7"},{"key":"ref11","volume-title":"SNAP Datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v29i1.9277","article-title":"The network data repository with interactive graph analytics and visualization","volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","author":"Rossi"},{"key":"ref13","volume-title":"Network data","author":"Newman","year":"2013"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","location":"Paris, France","start":{"date-parts":[[2019,4,29]]},"end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8831168\/8845034\/08845129.pdf?arnumber=8845129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T21:35:08Z","timestamp":1710365708000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8845129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/infcomw.2019.8845129","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}