{"id":"https://openalex.org/W7134979723","doi":"https://doi.org/10.1016/j.comgeo.2026.102268","title":"An improved exact algorithm for the Euclidean k-Steiner tree problem","display_name":"An improved exact algorithm for the Euclidean k-Steiner tree problem","publication_year":2026,"publication_date":"2026-03-10","ids":{"openalex":"https://openalex.org/W7134979723","doi":"https://doi.org/10.1016/j.comgeo.2026.102268"},"language":"en","primary_location":{"id":"doi:10.1016/j.comgeo.2026.102268","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.comgeo.2026.102268","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.comgeo.2026.102268","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050396958","display_name":"Jae Lee","orcid":null},"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":"Jae Lee","raw_affiliation_strings":["School of Mathematics and Statistics, University of Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090177909","display_name":"Marcus Brazil","orcid":null},"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":"Marcus Brazil","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, University of Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","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":true,"raw_author_name":"Charl Ras","raw_affiliation_strings":["School of Mathematics and Statistics, University of Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103348015","display_name":"DA Thomas","orcid":null},"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":"Doreen Thomas","raw_affiliation_strings":["Department of Mechanical Engineering, University of Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5057731467"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":{"value":2180,"currency":"USD","value_usd":2180},"apc_paid":{"value":2180,"currency":"USD","value_usd":2180},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.88048947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"135","issue":null,"first_page":"102268","last_page":"102268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9182999730110168,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9182999730110168,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03480000048875809,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.011699999682605267,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8044999837875366},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5627999901771545},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5530999898910522},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5228999853134155},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.47839999198913574},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4749999940395355},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4706999957561493},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4560999870300293},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.44359999895095825}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8044999837875366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6851999759674072},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5627999901771545},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5530999898910522},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5228999853134155},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5174000263214111},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4796999990940094},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.47839999198913574},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4749999940395355},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4706999957561493},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4560999870300293},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.44359999895095825},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4422999918460846},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.43070000410079956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4189000129699707},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3716999888420105},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.36550000309944153},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3546000123023987},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.33869999647140503},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.28850001096725464},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2727000117301941},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.26260000467300415},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2624000012874603},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.comgeo.2026.102268","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.comgeo.2026.102268","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.comgeo.2026.102268","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.comgeo.2026.102268","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W791344691","https://openalex.org/W1975807353","https://openalex.org/W1992380975","https://openalex.org/W2030203876","https://openalex.org/W2063473778","https://openalex.org/W2074330433","https://openalex.org/W2074664638","https://openalex.org/W2094311069","https://openalex.org/W2104723386","https://openalex.org/W2110367141","https://openalex.org/W2249534008","https://openalex.org/W3199358935","https://openalex.org/W4239626474","https://openalex.org/W4394617796"],"related_works":[],"abstract_inverted_index":{"In":[0,47],"the":[1,15,23,27,45,48,54,75,81,106,110,120,130],"classical":[2],"geometric":[3],"Steiner":[4,38,57],"tree":[5,52,85],"problem,":[6,53],"we":[7,124],"are":[8],"given":[9],"a":[10,89,115],"set":[11,28],"of":[12,29,34,56,102,109,132],"points":[13,58],"in":[14],"plane":[16],"and":[17,93],"our":[18],"aim":[19],"is":[20,59],"to":[21,43,61,79,97],"find":[22],"shortest":[24],"network":[25],"interconnecting":[26],"points.":[30],"An":[31],"unlimited":[32],"number":[33,55],"additional":[35,69],"vertices,":[36],"called":[37],"points,":[39],"may":[40],"be":[41],"added":[42],"shorten":[44],"network.":[46],"minimum":[49],"k":[50,65,83],"-Steiner":[51,84],"limited":[60],"some":[62],"nonnegative":[63],"integer":[64],",":[66],"which":[67],"creates":[68],"complexity.":[70],"This":[71],"paper":[72],"improves":[73],"on":[74],"current":[76],"algorithmic":[77],"approach":[78],"solving":[80],"Euclidean":[82],"problem.":[86],"We":[87,112],"introduce":[88,114],"novel":[90,134],"pruning":[91],"test":[92],"strengthen":[94],"existing":[95],"tests":[96],"allow":[98],"more":[99],"extensive":[100],"elimination":[101],"sub-optimal":[103],"topologies":[104],"during":[105],"generation":[107],"phase":[108],"algorithm.":[111],"also":[113],"new":[116],"ILP":[117],"model":[118],"for":[119],"concatenation":[121],"phase.":[122],"Finally,":[123],"present":[125],"experimental":[126],"results":[127],"that":[128],"demonstrate":[129],"effectiveness":[131],"these":[133],"components.":[135]},"counts_by_year":[],"updated_date":"2026-03-17T06:59:57.516163","created_date":"2026-03-12T00:00:00"}