{"id":"https://openalex.org/W1985149601","doi":"https://doi.org/10.1137/0220060","title":"Minimum Diameter Spanning Trees and Related Problems","display_name":"Minimum Diameter Spanning Trees and Related Problems","publication_year":1991,"publication_date":"1991-10-01","ids":{"openalex":"https://openalex.org/W1985149601","doi":"https://doi.org/10.1137/0220060","mag":"1985149601"},"language":"en","primary_location":{"id":"doi:10.1137/0220060","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220060","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5051317071","display_name":"Jan-Ming Ho","orcid":"https://orcid.org/0000-0002-2432-8233"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jan-Ming Ho","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034619208","display_name":"D. T. Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. T. Lee","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106223259","display_name":"Chia-Hsiang Chang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chia-Hsiang Chang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101858991","display_name":"C. K. Wong","orcid":"https://orcid.org/0000-0002-8678-4664"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. K. Wong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051317071"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3318,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.53913043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"20","issue":"5","first_page":"987","last_page":"997"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9927999973297119,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9907000064849854,"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/spanning-tree","display_name":"Spanning tree","score":0.8772518038749695},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.8500995635986328},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8371440172195435},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.7849575281143188},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7750308513641357},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6657374501228333},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6427371501922607},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6066049337387085},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.594728946685791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5382803082466125},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5321117043495178},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5279228687286377},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4752388000488281},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.44183316826820374},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4350975751876831},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4260125756263733},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4178684949874878},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.30839160084724426},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.195458322763443},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09767788648605347},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07915067672729492}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8772518038749695},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.8500995635986328},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8371440172195435},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.7849575281143188},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7750308513641357},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6657374501228333},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6427371501922607},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6066049337387085},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.594728946685791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5382803082466125},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5321117043495178},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5279228687286377},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4752388000488281},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.44183316826820374},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4350975751876831},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4260125756263733},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4178684949874878},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.30839160084724426},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.195458322763443},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09767788648605347},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07915067672729492},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220060","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220060","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1847031659","https://openalex.org/W2007610503","https://openalex.org/W2017927472","https://openalex.org/W2068376033","https://openalex.org/W2078908612","https://openalex.org/W2126876121","https://openalex.org/W2128865241","https://openalex.org/W2132026455","https://openalex.org/W2139594840","https://openalex.org/W2142337286","https://openalex.org/W2496556858"],"related_works":["https://openalex.org/W1985149601","https://openalex.org/W1997570556","https://openalex.org/W620960161","https://openalex.org/W1576317141","https://openalex.org/W2911818503","https://openalex.org/W2117879716","https://openalex.org/W2039611868","https://openalex.org/W1510935138","https://openalex.org/W2408068853","https://openalex.org/W2071845176"],"abstract_inverted_index":{"The":[0,22,57,93],"problem":[1,54,68],"of":[2,10,13,24,41,69,110],"finding":[3],"a":[4,11,25,47,63,72],"minimum":[5,96],"diameter":[6,23,79,97],"spanning":[7,26,73,98,112],"tree":[8,27,74,99],"(MDST)":[9],"set":[12],"n":[14],"points":[15,35,104],"in":[16,36,101,119],"the":[17,29,37,53,67,111],"Euclidean":[18],"space":[19],"is":[20,28,44,55,91,114],"considered.":[21],"maximum":[30],"distance":[31],"between":[32],"any":[33],"two":[34,84],"tree.":[38],"A":[39],"characterization":[40],"an":[42],"MDST":[43],"given":[45,85],"and":[46,78,88],"$\\theta":[48],"(n^3)$-time":[49],"algorithm":[50],"for":[51,62],"solving":[52],"presented.":[56],"authors":[58],"also":[59],"show":[60],"that":[61],"weighted":[64],"undirected":[65],"graph,":[66],"determining":[70],"if":[71],"with":[75],"total":[76],"weight":[77],"upper":[80],"bounded,":[81],"respectively,":[82],"by":[83],"parameters":[86],"C":[87],"D":[89],"exists":[90],"NP-complete.":[92],"geometric":[94],"Steiner":[95],"problem,":[100],"which":[102],"new":[103],"are":[105],"allowed":[106],"to":[107,116],"be":[108,117],"part":[109],"tree,":[113],"shown":[115],"solvable":[118],"$O(n)$":[120],"time.":[121]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}