{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T10:48:21Z","timestamp":1725446901973},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1109\/iccchina.2015.7448738","type":"proceedings-article","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T06:36:58Z","timestamp":1460097418000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic social feature-based diffusion in mobile social networks"],"prefix":"10.1109","author":[{"given":"Xiao","family":"Chen","sequence":"first","affiliation":[]},{"given":"Kaiqi","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458115"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935076"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1080829.1080855"},{"key":"ref13","article-title":"Self-interest-drive incentives for ad dissemination in autonomous mobile social networks","author":"ning","year":"2013","journal-title":"IEEE Info Com"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SECON.2012.6275832"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2248371.2248396"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6654792"},{"journal-title":"Crawdad trace cambridge\/haggle\/imote\/infocom 2006 (v 2009–05-29)","year":"2009","author":"scott","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1161089.1161100"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2009.5072147"},{"journal-title":"Data Mining Concepts and Techniques","year":"2012","author":"han","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374652"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288113"},{"year":"0","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848133"},{"journal-title":"An o(log*n) approximation algorithm for the asymmetric p-center problem","year":"1996","author":"vishwanathan","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195500"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835935"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7036832"}],"event":{"name":"2015 IEEE\/CIC International Conference on Communications in China (ICCC)","start":{"date-parts":[[2015,11,2]]},"location":"Shenzhen, China","end":{"date-parts":[[2015,11,4]]}},"container-title":["2015 IEEE\/CIC International Conference on Communications in China (ICCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7442693\/7448573\/07448738.pdf?arnumber=7448738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,9]],"date-time":"2017-03-09T20:09:55Z","timestamp":1489090195000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7448738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/iccchina.2015.7448738","relation":{},"subject":[],"published":{"date-parts":[[2015,11]]}}}