{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T21:24:19Z","timestamp":1774560259208,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T00:00:00Z","timestamp":1706659200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371320"],"award-info":[{"award-number":["12371320"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101587"],"award-info":[{"award-number":["12101587"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2022M720329"],"award-info":[{"award-number":["2022M720329"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005089","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["Z220004"],"award-info":[{"award-number":["Z220004"]}],"id":[{"id":"10.13039\/501100005089","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["High-Confidence Computing"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1016\/j.hcc.2024.100208","type":"journal-article","created":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T06:28:53Z","timestamp":1706855333000},"page":"100208","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["H-hop independently submodular maximization problem with curvature"],"prefix":"10.1016","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1607-1777","authenticated-orcid":false,"given":"Yang","family":"Lv","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6742-8816","authenticated-orcid":false,"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-0969","authenticated-orcid":false,"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ruiqi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.hcc.2024.100208_b1","doi-asserted-by":"crossref","first-page":"2361","DOI":"10.1109\/COMST.2019.2915069","article-title":"A survey of air-to-ground propagation channel modeling for unmanned aerial vehicles","volume":"21","author":"Khawaja","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"4","key":"10.1016\/j.hcc.2024.100208_b2","doi-asserted-by":"crossref","first-page":"2804","DOI":"10.1109\/COMST.2018.2856587","article-title":"A survey of channel modeling for UAV communications","volume":"20","author":"Khuwaja","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"3","key":"10.1016\/j.hcc.2024.100208_b3","doi-asserted-by":"crossref","first-page":"2334","DOI":"10.1109\/COMST.2019.2902862","article-title":"A tutorial on UAVs for wireless networks: Applications, challenges, and open problems","volume":"21","author":"Mozaffari","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"10.1016\/j.hcc.2024.100208_b4","unstructured":"L.X. Fan\u00a0Anqi, Chinese drones provide lifeline network services for flood-stranded residents, URL https:\/\/www.globaltimes.cn\/page\/202107\/1229363.shtml."},{"key":"10.1016\/j.hcc.2024.100208_b5","series-title":"International Computing and Combinatorics Conference","first-page":"183","article-title":"Approximation algorithms for the connected sensor cover problem","author":"Huang","year":"2015"},{"issue":"11","key":"10.1016\/j.hcc.2024.100208_b6","doi-asserted-by":"crossref","first-page":"7574","DOI":"10.1109\/TWC.2017.2751045","article-title":"Mobile unmanned aerial vehicles (UAVs) for energy-efficient Internet of Things communications","volume":"16","author":"Mozaffari","year":"2017","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"8","key":"10.1016\/j.hcc.2024.100208_b7","doi-asserted-by":"crossref","first-page":"5092","DOI":"10.1109\/TWC.2018.2838134","article-title":"UAV-enabled wireless power transfer: Trajectory design and energy optimization","volume":"17","author":"Xu","year":"2018","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"6","key":"10.1016\/j.hcc.2024.100208_b8","doi-asserted-by":"crossref","first-page":"3747","DOI":"10.1109\/TWC.2017.2688328","article-title":"Energy-efficient UAV communication with trajectory optimization","volume":"16","author":"Zeng","year":"2017","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"1","key":"10.1016\/j.hcc.2024.100208_b9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TCOMM.2020.3025578","article-title":"Packet error probability and effective throughput for ultra-reliable and low-latency UAV communications","volume":"69","author":"Wang","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.hcc.2024.100208_b10","series-title":"ICC 2019-2019 IEEE International Conference on Communications","first-page":"1","article-title":"UAV-aided low latency mobile edge computing with mmwave backhaul","author":"Yu","year":"2019"},{"issue":"3","key":"10.1016\/j.hcc.2024.100208_b11","doi-asserted-by":"crossref","first-page":"3424","DOI":"10.1109\/TVT.2020.2968343","article-title":"Energy-efficient UAV-assisted mobile edge computing: Resource allocation and trajectory optimization","volume":"69","author":"Li","year":"2020","journal-title":"IEEE Trans. Veh. Technol."},{"key":"10.1016\/j.hcc.2024.100208_b12","article-title":"Joint optimization of mobility and reliability-guaranteed air-to-ground communication for UAVs","author":"Zhou","year":"2022","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.hcc.2024.100208_b13","series-title":"2023 IEEE 43rd International Conference on Distributed Computing Systems","first-page":"120","article-title":"Coverage maximization of heterogeneous UAV networks","author":"Li","year":"2023"},{"issue":"2","key":"10.1016\/j.hcc.2024.100208_b14","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TNET.2021.3125982","article-title":"Throughput maximization of UAV networks","volume":"30","author":"Xu","year":"2021","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.hcc.2024.100208_b15","article-title":"An approximation algorithm for the h-Hop independently submodular maximization problem and its applications","author":"Xu","year":"2022","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.hcc.2024.100208_b16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions\u2014I","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.hcc.2024.100208_b17","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","article-title":"Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem","volume":"7","author":"Conforti","year":"1984","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.hcc.2024.100208_b18","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.orl.2015.12.016","article-title":"Maximizing expected utility over a knapsack constraint","volume":"44","author":"Yu","year":"2016","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10.1016\/j.hcc.2024.100208_b19","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TNET.2014.2301816","article-title":"Maximizing submodular set function with connectivity constraint: Theory and application to networks","volume":"23","author":"Kuo","year":"2014","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"10.1016\/j.hcc.2024.100208_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.hcc.2021.100004","article-title":"A model checking-based security analysis framework for IoT systems","volume":"1","author":"Fang","year":"2021","journal-title":"High-Confidence Comput."},{"issue":"1","key":"10.1016\/j.hcc.2024.100208_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.hcc.2021.100046","article-title":"Secure verifiable aggregation for blockchain-based federated averaging","volume":"2","author":"Zhu","year":"2022","journal-title":"High-Confidence Comput."},{"key":"10.1016\/j.hcc.2024.100208_b22","first-page":"4","article-title":"The prize collecting steiner tree problem: Theory and practice","volume":"vol. 1","author":"Johnson","year":"2000"},{"key":"10.1016\/j.hcc.2024.100208_b23","doi-asserted-by":"crossref","unstructured":"N. Garg, Saving an epsilon: A 2-approximation for the k-MST problem in graphs, in: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, 2005, pp. 396\u2013402.","DOI":"10.1145\/1060590.1060650"},{"key":"10.1016\/j.hcc.2024.100208_b24","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1702","article-title":"Analyzing the optimal neighborhood: Algorithms for budgeted and partial connected dominating set problems","author":"Khuller","year":"2014"}],"container-title":["High-Confidence Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295224000114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295224000114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T10:15:28Z","timestamp":1728036928000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2667295224000114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["S2667295224000114"],"URL":"https:\/\/doi.org\/10.1016\/j.hcc.2024.100208","relation":{},"ISSN":["2667-2952"],"issn-type":[{"value":"2667-2952","type":"print"}],"subject":[],"published":{"date-parts":[[2024,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"H-hop independently submodular maximization problem with curvature","name":"articletitle","label":"Article Title"},{"value":"High-Confidence Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.hcc.2024.100208","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Author(s). Published by Elsevier B.V. on behalf of Shandong University.","name":"copyright","label":"Copyright"}],"article-number":"100208"}}