{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:07:51Z","timestamp":1758845271325,"version":"3.37.3"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007567","name":"City University of Hong Kong","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796957","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:18:49Z","timestamp":1655759929000},"page":"1099-1108","source":"Crossref","is-referenced-by-count":8,"title":["Maximizing h-hop Independently Submodular Functions Under Connectivity Constraint"],"prefix":"10.1109","author":[{"given":"Wenzheng","family":"Xu","sequence":"first","affiliation":[{"name":"Sichuan University,College of Computer Science,Chengdu,P. R. China"}]},{"given":"Dezhong","family":"Peng","sequence":"additional","affiliation":[{"name":"Sichuan University,College of Computer Science,Chengdu,P. R. China"}]},{"given":"Weifa","family":"Liang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science,Hong Kong,P. R. China"}]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science,Hong Kong,P. R. China"}]},{"given":"Zichuan","family":"Xu","sequence":"additional","affiliation":[{"name":"Dalian University of Technology,School of Software,Dalian,P. R. China"}]},{"given":"Pan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,School of Cyber Science and Engineering,Wuhan,China"}]},{"given":"Weigang","family":"Wu","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University,Guangzhou,China,510006"}]},{"given":"Xiang","family":"Chen","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University,Guangzhou,China,510006"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2954306"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485934"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2651825"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3027434"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.03.029"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.2295609"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2913988"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155343"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3123606"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3125982"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.55"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2688328"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121195"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060650"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2864420"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3038156"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21398-9_15"},{"key":"ref16","first-page":"760","article-title":"The prize collecting Steiner tree problem: theory and practice","author":"johnson","year":"2000","journal-title":"Proc 11th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.123"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/18M1212094"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.60"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3184990"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1760"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.1600178CM"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/130929205"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.072"},{"key":"ref5","first-page":"241","article-title":"Deterministic (1\/2 + ?)-approximation for submodular maximization over a matroid","author":"buchbinder","year":"2019","journal-title":"Proc 30th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7470932"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_15"},{"key":"ref2","article-title":"Online myopic network covering","author":"avrachenkov","year":"2012","journal-title":"arXiv preprint arXiv 1212 5035"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2999630"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2014.2342736"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2301816"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2864373"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_19"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2864376"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3241539.3241549"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488887"},{"key":"ref23","first-page":"68","article-title":"Approximate coverage in wireless sensor networks","author":"liu","year":"2005","journal-title":"Proc 30th Annu IEEE Conf Local Comput Netw (LCN)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2925629"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","start":{"date-parts":[[2022,5,2]]},"location":"London, United Kingdom","end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796957.pdf?arnumber=9796957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T20:01:20Z","timestamp":1657569680000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796957\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796957","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}