{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:41:45Z","timestamp":1730299305072,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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,9]]},"DOI":"10.1109\/synasc49474.2019.00033","type":"proceedings-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T01:35:16Z","timestamp":1585618516000},"page":"182-189","source":"Crossref","is-referenced-by-count":1,"title":["Shapley Value and Extremal Optimization for the Network Influence Maximization Problem"],"prefix":"10.1109","author":[{"given":"Noemi","family":"Gasko","sequence":"first","affiliation":[]},{"given":"Mihai Alexandru","family":"Suciu","sequence":"additional","affiliation":[]},{"given":"Tamas","family":"Kepes","sequence":"additional","affiliation":[]},{"given":"Rodica Ioana","family":"Lung","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/1557019.1557047"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/CGC.2013.61"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ACCESS.2017.2764750"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-3-319-19890-3_18"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1142\/S0129065714400061"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.swevo.2011.11.003"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.ins.2016.07.012"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/978-3-319-31204-0_25","article-title":"Influence maximization in social networks with genetic algorithms","author":"bucur","year":"2016","journal-title":"European Conference on the Applications of Evolutionary Computation"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/j.physa.2017.02.067"},{"year":"2017","author":"bucur","article-title":"Multi-objective Evolutionary Algorithms for Influence Maximization in Social Networks Multi-Objective Evolutionary Algorithms for Influence Maximization in Social Networks","key":"ref19"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.asoc.2017.12.025","article-title":"A holistic approach to influence maximization in social networks: STORIE","volume":"66","author":"sumith","year":"2018","journal-title":"Applied Soft Computing Journal"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1086\/jar.33.4.3629752"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/s10489-018-1303-2"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TAAI.2011.42"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ASONAM.2014.6921640"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1016\/j.knosys.2018.06.013"},{"key":"ref7","article-title":"The probabilistic maximum coverage problem in social networks","author":"fan","year":"2011","journal-title":"GLOBECOM - IEEE Global Telecommunications Conference"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.socnet.2018.09.001"},{"key":"ref9","first-page":"137","article-title":"Maximizing the spread of´ influence through a social network","author":"kempe","year":"2004"},{"key":"ref1","article-title":"Product information diffusion in a social network","author":"zhang","year":"2018","journal-title":"Electronic Commerce Research"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/502512.502525"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1515\/9781400881970-018"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/956750.956769"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1103\/PhysRevE.74.036104"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1002\/cplx.10072"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/s00265-003-0651-y"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1002\/asi.21015"}],"event":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","start":{"date-parts":[[2019,9,4]]},"location":"Timisoara, Romania","end":{"date-parts":[[2019,9,7]]}},"container-title":["2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9036714\/9049830\/09049877.pdf?arnumber=9049877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T10:50:15Z","timestamp":1658141415000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9049877\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/synasc49474.2019.00033","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}