{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T10:43:56Z","timestamp":1786099436757,"version":"3.56.0"},"reference-count":61,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004152","name":"Macao Polytechnic University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004152","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.comnet.2026.112605","type":"journal-article","created":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T15:21:09Z","timestamp":1784906469000},"page":"112605","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Real-time exact solution for Steiner Tree Problem in HAPS networks"],"prefix":"10.1016","volume":"288","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4013-6442","authenticated-orcid":false,"given":"Yuqiang","family":"Wen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0377-3810","authenticated-orcid":false,"given":"K.L. Eddie","family":"Law","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.comnet.2026.112605_b1","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1007\/s11831-022-09867-9","article-title":"High altitude airship: A review of thermal analyses and design approaches","volume":"30","author":"Alam","year":"2023","journal-title":"Arch. Comput. Methods Eng."},{"issue":"3","key":"10.1016\/j.comnet.2026.112605_b2","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/MWC.012.2200365","article-title":"HAPS for 6G networks: Potential use cases, open challenges, and possible solutions","volume":"31","author":"Abbasi","year":"2024","journal-title":"IEEE Wirel. Commun."},{"key":"10.1016\/j.comnet.2026.112605_b3","series-title":"2017 2nd IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology","first-page":"1778","article-title":"Project loon: Innovating the connectivity worldwide","author":"Nagpal","year":"2017"},{"key":"10.1016\/j.comnet.2026.112605_b4","doi-asserted-by":"crossref","unstructured":"F. Uyeda, M. Alvidrez, E. Kline, B. Petrini, B. Barritt, D. Mandle, A.C. Alexander, SDN in the Stratosphere: Loon\u2019s Aerospace Mesh Network, in: Proc. ACM SIGCOMM 2022, 2022, pp. 264\u2013280.","DOI":"10.1145\/3544216.3544231"},{"key":"10.1016\/j.comnet.2026.112605_b5","unstructured":"B. Taha-Ahmed, M. Calvo-Ram\u00f3n, L. de Haro-Ariet, Digital television broadcasting from HAPs, in: Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications, 2006, pp. 146\u2013149."},{"issue":"11","key":"10.1016\/j.comnet.2026.112605_b6","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1109\/JPROC.2011.2159690","article-title":"The role of high-altitude platforms (HAPs) in the global wireless connectivity","volume":"99","author":"Mohammed","year":"2011","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.comnet.2026.112605_b7","series-title":"2018 International Conference on ICT for Rural Development","first-page":"35","article-title":"The potential use of high altitude platform station in rural telecommunication infrastructure","author":"Setiawan","year":"2018"},{"key":"10.1016\/j.comnet.2026.112605_b8","doi-asserted-by":"crossref","first-page":"210988","DOI":"10.1109\/ACCESS.2020.3037164","article-title":"An efficient content distribution network architecture using heterogeneous channels","volume":"8","author":"Wen","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.comnet.2026.112605_b9","series-title":"2023 IEEE 29th International Conference on Parallel and Distributed Systems","article-title":"Vertical heterogeneous channelling consensual systems","author":"Wen","year":"2023"},{"key":"10.1016\/j.comnet.2026.112605_b10","series-title":"2025 34th International Conference on Computer Communications and Networks","first-page":"1","article-title":"Modified Gamma and hyper-erlang distribution models for group broadcasting","author":"Wen","year":"2025"},{"key":"10.1016\/j.comnet.2026.112605_b11","series-title":"IEEE INFOCOM\u201993 the Conference on Computer Communications, Proceedings","first-page":"82","article-title":"How bad is naive multicast routing?","author":"Doar","year":"1993"},{"issue":"11","key":"10.1016\/j.comnet.2026.112605_b12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/MCOM.121.2100166","article-title":"On the topological aspects of UAV-assisted post-disaster wireless communication networks","volume":"59","author":"Matracia","year":"2021","journal-title":"IEEE Commun. Mag."},{"issue":"4","key":"10.1016\/j.comnet.2026.112605_b13","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0002051","article-title":"Network \u2018small-world-ness\u2019: a quantitative method for determining canonical network equivalence","volume":"3","author":"Humphries","year":"2008","journal-title":"PloS One"},{"key":"10.1016\/j.comnet.2026.112605_b14","series-title":"Reducibility Among Combinatorial Problems","author":"Karp","year":"2010"},{"issue":"10","key":"10.1016\/j.comnet.2026.112605_b15","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0274328","article-title":"Maximum acceptable communication delay for the realization of telesurgery","volume":"17","author":"Nankaku","year":"2022","journal-title":"PLoS One"},{"issue":"03","key":"10.1016\/j.comnet.2026.112605_b16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1097\/CM9.0000000000003257","article-title":"Influence of network latency and bandwidth on robot-assisted laparoscopic telesurgery: A pre-clinical experiment","volume":"138","author":"Wang","year":"2025","journal-title":"Chin. Med. J. (Engl)"},{"issue":"3","key":"10.1016\/j.comnet.2026.112605_b17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","article-title":"The Steiner problem in graphs","volume":"1","author":"Dreyfus","year":"1971","journal-title":"Networks"},{"key":"10.1016\/j.comnet.2026.112605_b18","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1007\/s10107-021-01757-5","article-title":"Implications, conflicts, and reductions for Steiner trees","volume":"197","author":"Rehfeldt","year":"2023","journal-title":"Math. Program."},{"key":"10.1016\/j.comnet.2026.112605_b19","doi-asserted-by":"crossref","unstructured":"G.A. Godoi, R. Tinos, D.S. Sanches, A graph-based crossover and soft-repair operators for the Steiner Tree Problem, in: X BRACIS 2021 (10th Brazilian Conference on Intelligent Systems), 2021.","DOI":"10.1007\/978-3-030-91702-9_8"},{"key":"10.1016\/j.comnet.2026.112605_b20","doi-asserted-by":"crossref","unstructured":"M. Prossegger, A. Bouchachia, Ant colony optimization for Steiner tree problems, in: Proceedings of the 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, 2008, pp. 331\u2013336.","DOI":"10.1145\/1456223.1456292"},{"issue":"6","key":"10.1016\/j.comnet.2026.112605_b21","first-page":"223","article-title":"An approach for solving minimum spanning tree problem using a modified ant colony optimization algorithm","volume":"10","author":"Niluminda","year":"2022","journal-title":"Am. J. Appl. Math."},{"issue":"1","key":"10.1016\/j.comnet.2026.112605_b22","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/TIA.2021.3121651","article-title":"IoT-enabled real-time management of smart grids with demand response aggregators","volume":"58","author":"Estebsari","year":"2021","journal-title":"IEEE Trans. Ind. Appl."},{"issue":"1","key":"10.1016\/j.comnet.2026.112605_b23","doi-asserted-by":"crossref","first-page":"6555","DOI":"10.1038\/s41598-023-50651-x","article-title":"Uncovering the hidden structure of small-world networks","volume":"14","author":"Lachgar","year":"2024","journal-title":"Sci. Rep."},{"issue":"2","key":"10.1016\/j.comnet.2026.112605_b24","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/net.22005","article-title":"Solving Steiner trees: Recent advances, challenges, and perspectives","volume":"77","author":"Ljubi\u0107","year":"2021","journal-title":"Networks"},{"key":"10.1016\/j.comnet.2026.112605_b25","article-title":"Reliability analysis of intelligent transportation system assisted by high altitude platform station: A stochastic modeling and deep reinforcement learning integration","author":"Jain","year":"2026","journal-title":"Veh. Commun."},{"key":"10.1016\/j.comnet.2026.112605_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2024.110866","article-title":"Utility optimization for computation offloading and splitting in time-varying HAP and LEO satellite integrated MEC networks","volume":"255","author":"Zhang","year":"2024","journal-title":"Comput. Netw."},{"issue":"12","key":"10.1016\/j.comnet.2026.112605_b27","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MCOM.001.2100477","article-title":"High-altitude platform stations as IMT base stations: Connectivity from the stratosphere","volume":"59","author":"Alexandre","year":"2022","journal-title":"IEEE Commun. Mag."},{"issue":"2","key":"10.1016\/j.comnet.2026.112605_b28","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1109\/COMST.2021.3066905","article-title":"A vision and framework for the high altitude platform station (HAPS) networks of the future","volume":"23","author":"Kurt","year":"2021","journal-title":"IEEE Commun. Surv. & Tutorials"},{"key":"10.1016\/j.comnet.2026.112605_b29","series-title":"HAPS: Why SoftBank is looking to the stratosphere","author":"SoftBank","year":"2024"},{"issue":"6684","key":"10.1016\/j.comnet.2026.112605_b30","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"issue":"2","key":"10.1016\/j.comnet.2026.112605_b31","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10109-007-0045-1","article-title":"Small-world characteristics on transportation networks: a perspective from network autocorrelation","volume":"9","author":"Xu","year":"2007","journal-title":"J. Geogr. Syst."},{"issue":"10","key":"10.1016\/j.comnet.2026.112605_b32","doi-asserted-by":"crossref","first-page":"1928","DOI":"10.1109\/LCOMM.2013.081313.131394","article-title":"A small world network model for energy efficient wireless networks","volume":"17","author":"Zhang","year":"2013","journal-title":"IEEE Commun. Lett."},{"key":"10.1016\/j.comnet.2026.112605_b33","first-page":"638","article-title":"On distinguishing between internet power law topology generators","volume":"vol. 2","author":"Bu","year":"2002"},{"key":"10.1016\/j.comnet.2026.112605_b34","doi-asserted-by":"crossref","unstructured":"J. Kleinberg, The small-world phenomenon: An algorithmic perspective, in: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000, pp. 163\u2013170.","DOI":"10.1145\/335305.335325"},{"issue":"6794","key":"10.1016\/j.comnet.2026.112605_b35","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"},{"issue":"4","key":"10.1016\/j.comnet.2026.112605_b36","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","article-title":"Send-and-split method for minimum-concave-cost network flows","volume":"12","author":"Erickson","year":"1987","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.comnet.2026.112605_b37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3371389","article-title":"Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces","volume":"16","author":"Kisfaludi-Bak","year":"2020","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"10.1016\/j.comnet.2026.112605_b38","series-title":"European Symposium on Algorithms","first-page":"795","article-title":"Extending reduction techniques for the Steiner tree problem","author":"Polzin","year":"2002"},{"key":"10.1016\/j.comnet.2026.112605_b39","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jda.2012.04.016","article-title":"Improved Steiner tree algorithms for bounded treewidth","volume":"16","author":"Chimani","year":"2012","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"10.1016\/j.comnet.2026.112605_b40","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/s00453-014-9934-0","article-title":"Speeding up dynamic programming with representative sets: An experimental evaluation of algorithms for Steiner tree on tree decompositions","volume":"71","author":"Fafianie","year":"2015","journal-title":"Algorithmica"},{"key":"10.1016\/j.comnet.2026.112605_b41","series-title":"45th International Symposium on Mathematical Foundations of Computer Science","article-title":"Computing a minimum-cost k-hop Steiner tree in tree-like metrics","author":"B\u00f6hm","year":"2020"},{"issue":"2","key":"10.1016\/j.comnet.2026.112605_b42","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s12532-016-0110-1","article-title":"Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm","volume":"9","author":"Hougardy","year":"2017","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.comnet.2026.112605_b43","series-title":"Advances in Steiner Trees","first-page":"175","article-title":"Preprocessing the Steiner problem in graphs","author":"Duin","year":"2000"},{"key":"10.1016\/j.comnet.2026.112605_b44","series-title":"International Conference on Operations Research","first-page":"19","article-title":"Faster algorithms for Steiner tree and related problems: From theory to practice","author":"Rehfeldt","year":"2022"},{"issue":"3","key":"10.1016\/j.comnet.2026.112605_b45","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","article-title":"Solving Steiner tree problems in graphs to optimality","volume":"32","author":"Koch","year":"1998","journal-title":"Networks: An Int. J."},{"issue":"4","key":"10.1016\/j.comnet.2026.112605_b46","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","article-title":"The Steiner problem with edge lengths 1 and 2","volume":"32","author":"Bern","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/j.comnet.2026.112605_b47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2432622.2432628","article-title":"Steiner tree approximation via iterative randomized rounding","volume":"60","author":"Byrka","year":"2013","journal-title":"J. ACM"},{"key":"10.1016\/j.comnet.2026.112605_b48","series-title":"2024 4th International Conference on Computer Science and Blockchain","first-page":"417","article-title":"Binary particle swarm optimization algorithm for euclidean Steiner tree","author":"Cao","year":"2024"},{"issue":"4","key":"10.1016\/j.comnet.2026.112605_b49","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10732-007-9057-8","article-title":"Simulated annealing algorithm for the robust spanning tree problem","volume":"14","author":"Nikulin","year":"2008","journal-title":"J. Heuristics"},{"issue":"2","key":"10.1016\/j.comnet.2026.112605_b50","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Inform."},{"issue":"6","key":"10.1016\/j.comnet.2026.112605_b51","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1109\/TCAD.2013.2238291","article-title":"ObSteiner: An exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles","volume":"32","author":"Huang","year":"2013","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"10.1016\/j.comnet.2026.112605_b52","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s12532-018-0135-8","article-title":"The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study","volume":"10","author":"Juhl","year":"2018","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.comnet.2026.112605_b53","series-title":"2019 IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology","first-page":"449","article-title":"Survey paper on multicast routing in mobile ad-hoc networks","author":"Farhan","year":"2019"},{"issue":"5","key":"10.1016\/j.comnet.2026.112605_b54","doi-asserted-by":"crossref","first-page":"2115","DOI":"10.3390\/app14052115","article-title":"Multicast routing based on data envelopment analysis and Markovian decision processes for multimodal transportation","volume":"14","author":"Aljanabi","year":"2024","journal-title":"Appl. Sci."},{"issue":"6","key":"10.1016\/j.comnet.2026.112605_b55","doi-asserted-by":"crossref","first-page":"5307","DOI":"10.1109\/TAES.2022.3169732","article-title":"Qos-aware software-defined multicast in LEO satellite networks","volume":"58","author":"Hu","year":"2022","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"10.1016\/j.comnet.2026.112605_b56","series-title":"2025 34th International Conference on Computer Communications and Networks","first-page":"1","article-title":"Cell-expansion and region-cut-split algorithms for Steiner tree problem in HAPS networks","author":"Wen","year":"2025"},{"key":"10.1016\/j.comnet.2026.112605_b57","series-title":"Scalable Parameterised Algorithms for two Steiner Problems","author":"Muniyappa","year":"2017"},{"issue":"2","key":"10.1016\/j.comnet.2026.112605_b58","doi-asserted-by":"crossref","first-page":"672","DOI":"10.48175\/IJARSCT-8024","article-title":"A review on fast convergence scheme in OSPF network","volume":"3","author":"Chanadana","year":"2023","journal-title":"Int. J. Adv. Res. Sci. Commun. Technol. (IJARSCT)"},{"key":"10.1016\/j.comnet.2026.112605_b59","doi-asserted-by":"crossref","DOI":"10.1016\/j.scico.2021.102609","article-title":"Ranking programming languages by energy efficiency","volume":"205","author":"Pereira","year":"2021","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.comnet.2026.112605_b60","series-title":"SteinLib: An Updated Library on Steiner Tree Problems in Graphs","author":"Koch","year":"2001"},{"issue":"11","key":"10.1016\/j.comnet.2026.112605_b61","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-library: distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626006171?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626006171?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T09:49:56Z","timestamp":1786096196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626006171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":61,"alternative-id":["S1389128626006171"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112605","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Real-time exact solution for Steiner Tree Problem in HAPS networks","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112605","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"112605"}}