{"id":"https://openalex.org/W4386257514","doi":"https://doi.org/10.1109/icit58056.2023.10226075","title":"Diameter-Constrained Minimum Spanning Tree Problems: A Survey","display_name":"Diameter-Constrained Minimum Spanning Tree Problems: A Survey","publication_year":2023,"publication_date":"2023-08-09","ids":{"openalex":"https://openalex.org/W4386257514","doi":"https://doi.org/10.1109/icit58056.2023.10226075"},"language":"en","primary_location":{"id":"doi:10.1109/icit58056.2023.10226075","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icit58056.2023.10226075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 International Conference on Information Technology (ICIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092027303","display_name":"Samar Hendawi","orcid":"https://orcid.org/0000-0001-5051-661X"},"institutions":[{"id":"https://openalex.org/I145019703","display_name":"Al-Zaytoonah University of Jordan","ror":"https://ror.org/04a5b0p13","country_code":"JO","type":"education","lineage":["https://openalex.org/I145019703"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Samar Hendawi","raw_affiliation_strings":["Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan","Department of Computer Science, Alzaytoonah University of Jordan, Amman, Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan","institution_ids":["https://openalex.org/I145019703"]},{"raw_affiliation_string":"Department of Computer Science, Alzaytoonah University of Jordan, Amman, Jordan","institution_ids":["https://openalex.org/I145019703"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011758131","display_name":"Islam Altalahin","orcid":null},"institutions":[{"id":"https://openalex.org/I145019703","display_name":"Al-Zaytoonah University of Jordan","ror":"https://ror.org/04a5b0p13","country_code":"JO","type":"education","lineage":["https://openalex.org/I145019703"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Islam Altalahin","raw_affiliation_strings":["Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan","Department of Computer Science, Alzaytoonah University of Jordan, Amman, Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan","institution_ids":["https://openalex.org/I145019703"]},{"raw_affiliation_string":"Department of Computer Science, Alzaytoonah University of Jordan, Amman, Jordan","institution_ids":["https://openalex.org/I145019703"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032974396","display_name":"Shadi AlZu\u2019bi","orcid":"https://orcid.org/0000-0003-4173-2323"},"institutions":[{"id":"https://openalex.org/I145019703","display_name":"Al-Zaytoonah University of Jordan","ror":"https://ror.org/04a5b0p13","country_code":"JO","type":"education","lineage":["https://openalex.org/I145019703"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Shadi AlZu'bi","raw_affiliation_strings":["Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan","Department of Computer Science, Alzaytoonah University of Jordan, Amman, Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan","institution_ids":["https://openalex.org/I145019703"]},{"raw_affiliation_string":"Department of Computer Science, Alzaytoonah University of Jordan, Amman, Jordan","institution_ids":["https://openalex.org/I145019703"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054352062","display_name":"Ayman M. Abdalla","orcid":"https://orcid.org/0000-0002-8085-289X"},"institutions":[{"id":"https://openalex.org/I145019703","display_name":"Al-Zaytoonah University of Jordan","ror":"https://ror.org/04a5b0p13","country_code":"JO","type":"education","lineage":["https://openalex.org/I145019703"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Ayman Abdalla","raw_affiliation_strings":["Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan","Department of Computer Science, Alzaytoonah University of Jordan, Amman, Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alzaytoonah University of Jordan,Department of Computer Science,Amman,Jordan","institution_ids":["https://openalex.org/I145019703"]},{"raw_affiliation_string":"Department of Computer Science, Alzaytoonah University of Jordan, Amman, Jordan","institution_ids":["https://openalex.org/I145019703"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145019703"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"771","last_page":"774"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9681000113487244,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7478751540184021},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.710921585559845},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.648223876953125},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5511932373046875},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5433124303817749},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.481444776058197},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4713192582130432},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44743719696998596},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44495853781700134},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4234338104724884},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4172179102897644},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35027897357940674},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2266157865524292},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.07988029718399048}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7478751540184021},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.710921585559845},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.648223876953125},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5511932373046875},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5433124303817749},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.481444776058197},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4713192582130432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44743719696998596},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44495853781700134},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4234338104724884},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4172179102897644},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35027897357940674},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2266157865524292},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.07988029718399048},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icit58056.2023.10226075","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icit58056.2023.10226075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 International Conference on Information Technology (ICIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1507484587","https://openalex.org/W1512275225","https://openalex.org/W1530007730","https://openalex.org/W1601251502","https://openalex.org/W1977502354","https://openalex.org/W1983511657","https://openalex.org/W2004681879","https://openalex.org/W2026551358","https://openalex.org/W2037725797","https://openalex.org/W2044146725","https://openalex.org/W2059559155","https://openalex.org/W2087324063","https://openalex.org/W2100344930","https://openalex.org/W2140470303","https://openalex.org/W2147736422","https://openalex.org/W2159991628","https://openalex.org/W2169528473","https://openalex.org/W2176143254","https://openalex.org/W2946411918","https://openalex.org/W2976170045","https://openalex.org/W3036355315","https://openalex.org/W3046886974","https://openalex.org/W3096485066","https://openalex.org/W3196685769","https://openalex.org/W4236821491","https://openalex.org/W4255306344","https://openalex.org/W4307850734","https://openalex.org/W6685821207"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"The":[0],"diameter":[1,44],"of":[2,8,26,29,79,171,182,190,205],"a":[3,6,38,43,47,51,77,84,113],"tree":[4,18,41],"is":[5,22,37,53,186,194],"measure":[7],"the":[9,17,27,72,107,129,146,162,180,184,201,206],"longest":[10],"path":[11,21],"between":[12],"any":[13],"two":[14,94],"nodes":[15],"in":[16,24,169,200],"where":[19],"this":[20,150],"defined":[23],"terms":[25,170],"number":[28,78],"edges.":[30],"A":[31],"Diameter-Constrained":[32],"Minimum":[33],"Spanning":[34],"Tree":[35],"(DCMST)":[36],"minimum-weight":[39],"spanning":[40,65],"with":[42,67],"less":[45],"than":[46],"given":[48],"integer.":[49],"Finding":[50],"DCMST":[52,85,109,163,185],"an":[54,136,187],"NP-complete":[55],"problem,":[56],"and":[57,70,98,117,165,175,192,203],"it":[58],"may":[59,140],"require":[60],"searching":[61],"through":[62],"all":[63],"possible":[64],"trees":[66],"acceptable":[68],"diameters":[69],"finding":[71,83,183],"minimum.":[73],"There":[74],"have":[75,112,157],"been":[76,158],"algorithms":[80,88,97,102,155],"proposed":[81,159],"for":[82,122,160,197],"efficiently.":[86],"These":[87],"can":[89],"be":[90,142],"broadly":[91],"classified":[92],"into":[93],"categories:":[95],"exact":[96,108,147],"approximate":[99,137],"algorithms.":[100,148,208],"Exact":[101],"are":[103,119,132],"able":[104,133],"to":[105,134],"find":[106,135],"but":[110,139],"generally":[111],"higher":[114],"time":[115,172],"complexity":[116],"they":[118],"not":[120,141],"suitable":[121],"very":[123],"large":[124],"trees.":[125],"Approximate":[126],"algorithms,":[127],"on":[128],"other":[130,176],"hand,":[131],"DCMST,":[138],"as":[143,145],"accurate":[144],"In":[149],"survey,":[151],"we":[152],"review":[153],"various":[154],"that":[156],"solving":[161],"problem":[164,181],"compare":[166],"their":[167],"performance":[168],"complexity,":[173],"accuracy,":[174],"relevant":[177],"factors.":[178],"Over-all,":[179],"active":[188],"area":[189],"research,":[191],"there":[193],"still":[195],"room":[196],"further":[198],"improvement":[199],"efficiency":[202],"accuracy":[204],"existing":[207]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}