{"id":"https://openalex.org/W2523915986","doi":"https://doi.org/10.1002/net.21710","title":"Minimum bottleneck spanning trees with degree bounds","display_name":"Minimum bottleneck spanning trees with degree bounds","publication_year":2016,"publication_date":"2016-09-30","ids":{"openalex":"https://openalex.org/W2523915986","doi":"https://doi.org/10.1002/net.21710","mag":"2523915986"},"language":"en","primary_location":{"id":"doi:10.1002/net.21710","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21710","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5035133272","display_name":"Patrick Andersen","orcid":"https://orcid.org/0000-0003-4987-1643"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Patrick J. Andersen","raw_affiliation_strings":["School of Mathematics and Statistics The University of Melbourne Melbourne Victoria Australia","School of Mathematics and Statistics, The University of Melbourne, Melbourne, Victoria, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics The University of Melbourne Melbourne Victoria Australia","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"School of Mathematics and Statistics, The University of Melbourne, Melbourne, Victoria, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057731467","display_name":"Charl Ras","orcid":"https://orcid.org/0000-0001-9986-2767"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Charl J. Ras","raw_affiliation_strings":["School of Mathematics and Statistics The University of Melbourne Melbourne Victoria Australia","School of Mathematics and Statistics, The University of Melbourne, Melbourne, Victoria, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics The University of Melbourne Melbourne Victoria Australia","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"School of Mathematics and Statistics, The University of Melbourne, Melbourne, Victoria, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035133272"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":{"value":3750,"currency":"USD","value_usd":3750},"apc_paid":null,"fwci":6.3364,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.95972774,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"68","issue":"4","first_page":"302","last_page":"314"},"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.9966999888420105,"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.9966999888420105,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.9843000173568726,"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/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.813779354095459},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8022381663322449},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7547746896743774},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7470840215682983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6856184005737305},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6823110580444336},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5590512156486511},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5248265862464905},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5034543871879578},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5022077560424805},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.47847554087638855},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47655847668647766},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4335689842700958},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4312351644039154},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4248698353767395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4219602346420288},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36586815118789673},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2546195387840271},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17648425698280334},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11022204160690308}],"concepts":[{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.813779354095459},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8022381663322449},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7547746896743774},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7470840215682983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6856184005737305},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6823110580444336},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5590512156486511},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5248265862464905},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5034543871879578},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5022077560424805},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.47847554087638855},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47655847668647766},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4335689842700958},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4312351644039154},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4248698353767395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4219602346420288},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36586815118789673},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2546195387840271},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17648425698280334},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11022204160690308},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.21710","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.21710","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/291785","is_oa":false,"landing_page_url":"http://hdl.handle.net/11343/291785","pdf_url":null,"source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"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":23,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1968182342","https://openalex.org/W1977267311","https://openalex.org/W1988706875","https://openalex.org/W2011039300","https://openalex.org/W2017927472","https://openalex.org/W2022563199","https://openalex.org/W2055505431","https://openalex.org/W2072970094","https://openalex.org/W2087216833","https://openalex.org/W2088839217","https://openalex.org/W2107568719","https://openalex.org/W2116680937","https://openalex.org/W2117226423","https://openalex.org/W2140787410","https://openalex.org/W2157421865","https://openalex.org/W2161071733","https://openalex.org/W2162750432","https://openalex.org/W2167579893","https://openalex.org/W2317079499","https://openalex.org/W2602800732","https://openalex.org/W3099328339","https://openalex.org/W4205775998"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W4308416203","https://openalex.org/W1985149601","https://openalex.org/W2059360098","https://openalex.org/W3016811403","https://openalex.org/W1964611452","https://openalex.org/W88291963","https://openalex.org/W2014991506","https://openalex.org/W3099328339","https://openalex.org/W2387385213"],"abstract_inverted_index":{"Given":[0],"a":[1,17,33,43,140,167,177,185],"graph":[2,115,147],"G":[3],"with":[4,157],"edge":[5,26,111],"lengths,":[6],"the":[7,21,24,53,58,69,82,93,99,114,122,124,145,150,154,162,172,181,190],"minimum":[8,38,44],"bottleneck":[9,45],"spanning":[10,18,39,46],"tree":[11,19,28,40,70],"(MBST)":[12],"problem":[13,59,86,101,125,151],"is":[14,29,32,42,57,102,126,153],"to":[15,81,92,159,200],"find":[16],"where":[20],"length":[22],"of":[23,60,113,149,195],"longest":[25],"in":[27,68,121],"minimum.":[30],"It":[31],"well\u2010known":[34],"fact":[35],"that":[36,65,78,98,109],"every":[37,66],"(MST)":[41],"tree.":[47],"In":[48],"this":[49],"article,":[50],"we":[51,96,165],"introduce":[52],"\u03b4\u2010MBST":[54,100],"problem,":[55],"which":[56,152,196],"finding":[61],"an":[62],"MBST":[63],"such":[64],"vertex":[67],"has":[71],"degree":[72],"at":[73],"most":[74],"\u03b4.":[75],"We":[76,107,138,174],"show":[77,108],"optimal":[79,90],"solutions":[80,91],"similarly":[83],"defined":[84],"\u03b4\u2010MST":[85],"are":[87,116],"not":[88],"necessarily":[89],"\u03b4\u2010MBST,":[94,193],"and":[95,132,134,184],"establish":[97],"NP\u2010complete":[103],"for":[104,128,136,144,171,180,189],"any":[105],".":[106,137],"when":[110],"lengths":[112],"Euclidean":[117,163,182,192],"distances":[118],"between":[119],"points":[120],"plane,":[123],"NP\u2010hard":[127],"\u03b4":[129],"=":[130],"2":[131],"3,":[133],"tractable":[135],"give":[139,166,176],"dual":[141],"approximation":[142,169,187],"scheme":[143],"general":[146,191],"version":[148],"best":[155],"possible":[156],"respect":[158],"feasibility.":[160],"For":[161],"version,":[164],"\u2010factor":[168],"algorithm":[170,179,188],"4\u2010MBST.":[173],"also":[175],"2\u2010factor":[178],"3\u2010MBST":[183],"3\u2010factor":[186],"both":[194],"can":[197],"be":[198],"generalized":[199],"metric":[201],"spaces.":[202],"\u00a9":[203],"2016":[204,212],"Wiley":[205],"Periodicals,":[206],"Inc.":[207],"NETWORKS,":[208],"Vol.":[209],"68(4),":[210],"302\u2013314":[211]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}