{"id":"https://openalex.org/W2140470303","doi":"https://doi.org/10.1080/00207160211289","title":"Random-tree Diameter and the Diameter-constrained MST","display_name":"Random-tree Diameter and the Diameter-constrained MST","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2140470303","doi":"https://doi.org/10.1080/00207160211289","mag":"2140470303"},"language":"en","primary_location":{"id":"doi:10.1080/00207160211289","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160211289","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://stars.library.ucf.edu/scopus2000/2289","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054352062","display_name":"Ayman M. Abdalla","orcid":"https://orcid.org/0000-0002-8085-289X"},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ayman Abdalla","raw_affiliation_strings":["School of Electrical Engineering and Computer Science , University of Central Florida , Orlando, FL, 32816-2362","School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL, 32816\u20102362"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science , University of Central Florida , Orlando, FL, 32816-2362","institution_ids":["https://openalex.org/I106165777"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL, 32816\u20102362","institution_ids":["https://openalex.org/I106165777"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108559244","display_name":"Narsingh Deo","orcid":null},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Narsingh Deo","raw_affiliation_strings":["School of Electrical Engineering and Computer Science , University of Central Florida , Orlando, FL, 32816-2362","School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL, 32816\u20102362"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science , University of Central Florida , Orlando, FL, 32816-2362","institution_ids":["https://openalex.org/I106165777"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL, 32816\u20102362","institution_ids":["https://openalex.org/I106165777"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054352062"],"corresponding_institution_ids":["https://openalex.org/I106165777"],"apc_list":null,"apc_paid":null,"fwci":1.8473,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.88778941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"79","issue":"6","first_page":"651","last_page":"663"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8248752355575562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7382258772850037},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7353223562240601},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6569740772247314},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.649997889995575},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.44723278284072876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44585514068603516},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4432542026042938},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43635135889053345},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.43632084131240845},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.42860543727874756},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4142667353153229},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40097475051879883},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3540222942829132},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21086612343788147},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.20106291770935059},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.16351434588432312},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13794907927513123}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8248752355575562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7382258772850037},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7353223562240601},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6569740772247314},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.649997889995575},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.44723278284072876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44585514068603516},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4432542026042938},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43635135889053345},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.43632084131240845},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.42860543727874756},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4142667353153229},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40097475051879883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3540222942829132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21086612343788147},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.20106291770935059},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.16351434588432312},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13794907927513123},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/00207160211289","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160211289","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:stars.library.ucf.edu:scopus2000-3288","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2000/2289","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 2000s","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.3206","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucf.edu/~abdalla/cn2000.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:stars.library.ucf.edu:scopus2000-3288","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2000/2289","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 2000s","raw_type":"text"},"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1340063","https://openalex.org/W114403858","https://openalex.org/W194519168","https://openalex.org/W1554451661","https://openalex.org/W1593663058","https://openalex.org/W1977545325","https://openalex.org/W1999818096","https://openalex.org/W2011039300","https://openalex.org/W2024315858","https://openalex.org/W2075167911","https://openalex.org/W2087937221","https://openalex.org/W2115831664","https://openalex.org/W2129084394","https://openalex.org/W2140606557","https://openalex.org/W2159376684","https://openalex.org/W2292528083","https://openalex.org/W4253639210","https://openalex.org/W4285719527","https://openalex.org/W6633204241"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W3016811403","https://openalex.org/W4380840098","https://openalex.org/W620960161","https://openalex.org/W2390742649","https://openalex.org/W4387560073","https://openalex.org/W2387385213","https://openalex.org/W4224074580"],"abstract_inverted_index":{"A":[0],"minimum":[1],"spanning":[2,65,73],"tree":[3,66],"(MST)":[4],"with":[5,54,67,81],"a":[6,58,64,161],"small":[7,35],"diameter":[8,116],"is":[9,88],"required":[10],"in":[11,120,136],"numerous":[12],"practical":[13],"situations":[14],"such":[15],"as":[16,45],"when":[17,24],"distributed":[18],"mutual-exclusion":[19],"algorithms":[20,27],"are":[21],"used,":[22],"or":[23],"information":[25],"retrieval":[26],"need":[28],"to":[29,90],"compromise":[30],"between":[31],"fast":[32],"access":[33],"and":[34,57,144],"storage.":[36],"The":[37],"Diameter-Constrained":[38],"MST":[39,119],"(DCMST)":[40],"problem":[41,87,135],"can":[42],"be":[43,91],"stated":[44],"follows:":[46],"given":[47],"an":[48,118],"undirected,":[49],"edge-weighted":[50],"graph,":[51],"G":[52,76],",":[53,62],"n":[55,104],"nodes":[56],"positive":[59],"integer,":[60],"k":[61,84,97,101],"find":[63],"the":[68,112,115,133,155],"smallest":[69],"weight":[70],"among":[71],"all":[72,94],"trees":[74],"of":[75,96,114,117,146,164],"which":[77],"contain":[78],"no":[79],"path":[80],"more":[82],"than":[83],"edges.":[85],"This":[86],"known":[89],"NP-complete,":[92],"for":[93,132,160],"values":[95],";":[98],"4":[99],"h":[100,102],"(":[103],"m":[105],"2).":[106],"In":[107],"this":[108],"paper,":[109],"we":[110,125],"investigate":[111],"behavior":[113],"randomly":[121],"generated":[122],"graphs.":[123],"Then,":[124],"present":[126],"heuristics":[127,156],"that":[128,154],"produce":[129,157],"approximate":[130],"solutions":[131,159],"DCMST":[134],"polynomial":[137],"time.":[138],"We":[139],"discuss":[140],"convergence,":[141],"relative":[142],"merits,":[143],"implementation":[145],"these":[147],"heuristics.":[148],"Our":[149],"extensive":[150],"empirical":[151],"study":[152],"shows":[153],"good":[158],"wide":[162],"variety":[163],"inputs.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}