{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:43:31Z","timestamp":1729651411933,"version":"3.28.0"},"reference-count":8,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/iswpc.2013.6707432","type":"proceedings-article","created":{"date-parts":[[2014,1,10]],"date-time":"2014-01-10T15:09:02Z","timestamp":1389366542000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial time approximation scheme for t-latency bounded information propagation problem in heterogeneous wireless networks"],"prefix":"10.1109","author":[{"given":"Rahat Ibn","family":"Rafiq","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahman","family":"Farhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"3","DOI":"10.1137\/080714452"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1145\/956750.956769"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1145\/502512.502525"},{"key":"7","volume":"2","author":"zou","year":"1978","journal-title":"Fast Information Propagation in Social Networks"},{"key":"6","article-title":"Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks","author":"zhang","year":"2009","journal-title":"Journal of Combinatorial Optimization"},{"key":"5","first-page":"152","author":"peleg","year":"1996","journal-title":"Local majority voting small coalitions and controlling monopolies in graphs A review"},{"key":"4","volume":"14","author":"nemhauser","year":"1978","journal-title":"An Analysis of the Approximations for Maximizing Submodular Set Functions"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03417-6_51","article-title":"Latency-bounded minimum influential node selection in social networks","author":"zou","year":"2009","journal-title":"Wireless Algorithms Systems and Applications"}],"event":{"name":"2013 International Symposium on Wireless and Pervasive Computing (ISWPC)","start":{"date-parts":[[2013,11,20]]},"location":"Taipei","end":{"date-parts":[[2013,11,22]]}},"container-title":["International Symposium on Wireless and pervasive Computing (ISWPC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6695813\/6707422\/06707432.pdf?arnumber=6707432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T01:51:05Z","timestamp":1498096265000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6707432\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/iswpc.2013.6707432","relation":{},"subject":[],"published":{"date-parts":[[2013,11]]}}}