{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T07:25:08Z","timestamp":1749108308904,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071459","11991022"],"award-info":[{"award-number":["12071459","11991022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["E1E40107"],"award-info":[{"award-number":["E1E40107"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1109\/tcss.2022.3151496","type":"journal-article","created":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T20:24:16Z","timestamp":1646339056000},"page":"958-969","source":"Crossref","is-referenced-by-count":3,"title":["Output\u2013Input Ratio Maximization for Online Social Networks: Algorithms and Analyses"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9486-0674","authenticated-orcid":false,"given":"Shengminjie","family":"Chen","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5122-4854","authenticated-orcid":false,"given":"Yapu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Operations Research and Information Engineering, Beijing University of Technology, Beijing, China"}]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, China"}]}],"member":"263","reference":[{"key":"ref13","first-page":"4684","article-title":"Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications","author":"harshaw","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref35","first-page":"2751","article-title":"Algorithms for optimizing the ratio of submodular functions","volume":"48","author":"bai","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34980-6_13"},{"key":"ref34","first-page":"1106","article-title":"Limiting the influence to vulnerable users in social networks: A ratio perspective","author":"chen","year":"2019","journal-title":"Proc IEEE Int Conf Adv Inf Netw Appl (AINA)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.2964882"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3209582.3209595"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref36"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.12.041"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850581"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485975"},{"key":"ref33","article-title":"On the approximation relationship between optimizing ratio of submodular (RS) and difference of submodular (DS) functions","author":"perrault","year":"2021","journal-title":"arXiv 2101 01631"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2016.7784445"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90003-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956769"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524470"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2898413"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.40"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/3467861.3467866"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00062"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.145"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882961"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401961"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.73"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106797"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.110"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","article-title":"An analysis of approximations for maximizing submodular set functions–II","volume":"8","author":"nemhauser","year":"1978","journal-title":"Math Program Stud"},{"key":"ref29","first-page":"407","article-title":"Algorithms for approximate minimization of the difference between submodular functions, with applications","author":"iyer","year":"2012","journal-title":"Proc 28th Conf Uncertainty Artif Intell (UAI)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2911865"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570650\/10132891\/09726780.pdf?arnumber=9726780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T18:15:18Z","timestamp":1687198518000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9726780\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":36,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2022.3151496","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"type":"electronic","value":"2329-924X"},{"type":"electronic","value":"2373-7476"}],"subject":[],"published":{"date-parts":[[2023,6]]}}}