{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T14:59:29Z","timestamp":1770044369822,"version":"3.49.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T00:00:00Z","timestamp":1691539200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T00:00:00Z","timestamp":1691539200000},"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":[[2023,8,9]]},"DOI":"10.1109\/icit58056.2023.10226075","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T17:26:12Z","timestamp":1693329972000},"page":"771-774","source":"Crossref","is-referenced-by-count":1,"title":["Diameter-Constrained Minimum Spanning Tree Problems: A Survey"],"prefix":"10.1109","author":[{"given":"Samar","family":"Hendawi","sequence":"first","affiliation":[{"name":"Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Islam","family":"Altalahin","sequence":"additional","affiliation":[{"name":"Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shadi","family":"AlZu'bi","sequence":"additional","affiliation":[{"name":"Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayman","family":"Abdalla","sequence":"additional","affiliation":[{"name":"Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.05.020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JEEIT.2019.8717473"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_122"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106050"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0743-z"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12610"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.103237"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2019.1089"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2014.0617"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref32","article-title":"Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem","volume":"39","author":"patvardhan","year":"2015","journal-title":"Informatica"},{"key":"ref2","first-page":"131","article-title":"Parallel computation of a diameter-constrained mst and related problems","author":"abdalla","year":"0","journal-title":"Congressus Numerantium"},{"key":"ref1","volume":"24","author":"shasha","year":"1994","journal-title":"Ex-act and approximate algorithms for unordered 'he matching"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-009-9611-z"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/18756891.2013.816027"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/62.2160"},{"key":"ref18","first-page":"235","article-title":"An algorithm for finding a spanning tree with minimum diameter","volume":"29","author":"karp","year":"1982","journal-title":"Journal of the ACM"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2010.00780.x"},{"key":"ref23","author":"chung","year":"2010","journal-title":"Diameter of random spanning trees in a given graph"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.009"},{"key":"ref25","author":"dos santos","year":"2010","journal-title":"Solving diameter constrained minimum spanning tree problems in dense graphs"},{"key":"ref20","first-page":"1045","article-title":"A heuristic algorithm for finding a spanning tree with minimum diameter","volume":"85","author":"chen","year":"2008","journal-title":"International Journal of Computer Mathematics"},{"key":"ref22","author":"nardelli","year":"2008","journal-title":"Finding all the best swaps of a minimum diameter spanning tree under transient edge failures"},{"key":"ref21","first-page":"191","article-title":"A heuristic algorithm for finding a spanning tree with minimum similarity","volume":"87","author":"chen","year":"2010","journal-title":"International Journal of Computer Mathematics"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.09.003"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00183-Y"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1498699"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1153-7_200635"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"12610e","DOI":"10.1111\/exsy.12610","article-title":"Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem","volume":"38","author":"vuppuluri","year":"2021","journal-title":"Expert Systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2033241"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0297-2"},{"key":"ref3","first-page":"97","article-title":"Parallel heuristics for the diameter-constrained mst problem","author":"abdalla","year":"0","journal-title":"Congressus Numerantium"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/00207160211289"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46521-9_2"}],"event":{"name":"2023 International Conference on Information Technology (ICIT)","location":"Amman, Jordan","start":{"date-parts":[[2023,8,9]]},"end":{"date-parts":[[2023,8,10]]}},"container-title":["2023 International Conference on Information Technology (ICIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10225686\/10225751\/10226075.pdf?arnumber=10226075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:43:17Z","timestamp":1695058997000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10226075\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,9]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/icit58056.2023.10226075","relation":{},"subject":[],"published":{"date-parts":[[2023,8,9]]}}}