{"id":"https://openalex.org/W2070308700","doi":"https://doi.org/10.1002/(sici)1097-0037(199710)30:3<149::aid-net1>3.0.co;2-l","title":"Euclidean Steiner minimum trees: An improved exact algorithm","display_name":"Euclidean Steiner minimum trees: An improved exact algorithm","publication_year":1997,"publication_date":"1997-10-01","ids":{"openalex":"https://openalex.org/W2070308700","doi":"https://doi.org/10.1002/(sici)1097-0037(199710)30:3<149::aid-net1>3.0.co;2-l","mag":"2070308700"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199710)30:3<149::aid-net1>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199710)30:3<149::aid-net1>3.0.co;2-l","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/A5030887041","display_name":"Pawe\u0142 Winter","orcid":"https://orcid.org/0000-0003-2669-0524"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Pawel Winter","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen \u2298, Denmark","Department of Computer Science, University of Copenhagen, DK 2100 Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen \u2298, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, DK 2100 Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057902603","display_name":"Martin Zachariasen","orcid":"https://orcid.org/0000-0002-2329-3606"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Martin Zachariasen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen \u2298, Denmark","Department of Computer Science, University of Copenhagen, DK 2100 Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen \u2298, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, DK 2100 Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030887041"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":7.5511,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.9755206,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"30","issue":"3","first_page":"149","last_page":"166"},"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.9919999837875366,"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.9919999837875366,"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/T11880","display_name":"Forest ecology and management","score":0.9664999842643738,"subfield":{"id":"https://openalex.org/subfields/2309","display_name":"Nature and Landscape Conservation"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12118","display_name":"Forest Biomass Utilization and Management","score":0.9546999931335449,"subfield":{"id":"https://openalex.org/subfields/2211","display_name":"Mechanics of Materials"},"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.9158617258071899},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.637127161026001},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6020156741142273},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.5483999848365784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5223154425621033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5194913148880005},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4698582887649536},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.46459221839904785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4506695866584778},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4205944836139679},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39909693598747253},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09883889555931091}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9158617258071899},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.637127161026001},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6020156741142273},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.5483999848365784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5223154425621033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5194913148880005},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4698582887649536},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.46459221839904785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4506695866584778},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4205944836139679},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39909693598747253},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09883889555931091},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199710)30:3<149::aid-net1>3.0.co;2-l","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199710)30:3<149::aid-net1>3.0.co;2-l","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:pure.atira.dk:openaire_cris_publications/057ec9e0-74cb-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/057ec9e0-74cb-11db-bee9-02004c4f4f50","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Winter , P & Zachariasen , M 1997 , ' Euclidean Steiner Minimum Trees: An Improved Exact Algorithm ' , NETWORKS , vol. 30 , pp. 149-166 .","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/057ec9e0-74cb-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/euclidean-steiner-minimum-trees-an-improved-exact-algorithm(057ec9e0-74cb-11db-bee9-02004c4f4f50).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Winter , P & Zachariasen , M 1997 , ' Euclidean Steiner Minimum Trees: An Improved Exact Algorithm ' , NETWORKS , vol. 30 , pp. 149-166 .","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1584380088","https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W3184075718"],"abstract_inverted_index":{"The":[0],"Euclidean":[1],"Steiner":[2,66],"tree":[3],"problem":[4,24,33,74,85,103],"asks":[5],"for":[6,100,109],"a":[7,11,45],"shortest":[8],"network":[9],"interconnecting":[10],"set":[12],"of":[13,64],"terminals":[14,78,89],"in":[15,79,90],"the":[16,19,22,59,62],"plane.":[17],"Over":[18],"last":[20],"decade,":[21],"maximum":[23],"size":[25],"solvable":[26],"within":[27],"1":[28],"h":[29],"(for":[30],"randomly":[31,72,101],"generated":[32,73,102],"instances)":[34],"has":[35,52],"increased":[36],"from":[37],"10":[38],"to":[39,97],"approximately":[40],"50":[41,77],"terminals.":[42],"We":[43],"present":[44,106],"new":[46],"exact":[47],"algorithm,":[48],"called":[49],"geosteiner96.":[50],"It":[51],"several":[53],"algorithmic":[54],"modifications":[55],"which":[56],"improve":[57],"both":[58],"generation":[60],"and":[61,84,114],"concatenation":[63],"full":[65],"trees.":[67],"On":[68],"average,":[69],"geosteiner96":[70],"solves":[71],"instances":[75,86,113],"with":[76,87],"less":[80,91],"than":[81,92],"2":[82],"min":[83],"100":[88],"8":[93],"min.":[94],"In":[95],"addition":[96],"computational":[98,107],"results":[99,108],"instances,":[104],"we":[105],"(perturbed)":[110],"regular":[111],"lattice":[112],"public":[115],"library":[116],"instances.":[117],"\u00a9":[118],"1997":[119,127],"John":[120],"Wiley":[121],"&":[122],"Sons,":[123],"Inc.":[124],"Networks":[125],"30:149\u2013166,":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2025-10-10T00:00:00"}