{"id":"https://openalex.org/W1975807353","doi":"https://doi.org/10.1002/net.3230150305","title":"An algorithm for the steiner problem in the euclidean plane","display_name":"An algorithm for the steiner problem in the euclidean plane","publication_year":1985,"publication_date":"1985-09-01","ids":{"openalex":"https://openalex.org/W1975807353","doi":"https://doi.org/10.1002/net.3230150305","mag":"1975807353"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230150305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150305","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":["DIKU, Institute of Datalogy, University of Copenhagen, Sigurdsgade 41, DK-2200 Copenhagen N, Denmark","DIKU, Institute of Datalogy, University of Copenhagen, Sigurdsgade 41, DK\u20102200 Copenhagen N, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIKU, Institute of Datalogy, University of Copenhagen, Sigurdsgade 41, DK-2200 Copenhagen N, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"DIKU, Institute of Datalogy, University of Copenhagen, Sigurdsgade 41, DK\u20102200 Copenhagen N, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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":1.0299,"has_fulltext":false,"cited_by_count":90,"citation_normalized_percentile":{"value":0.73565858,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"3","first_page":"323","last_page":"345"},"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.9997000098228455,"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.9997000098228455,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9713000059127808,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9550875425338745},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6806947588920593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6004965901374817},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5725129842758179},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5105711221694946},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5065580606460571},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.47090649604797363},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4693164825439453},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42272478342056274}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9550875425338745},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6806947588920593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6004965901374817},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5725129842758179},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5105711221694946},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5065580606460571},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.47090649604797363},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4693164825439453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42272478342056274},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230150305","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150305","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:publications/9611fa93-e1a2-497c-8732-853ba16dd84d","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/9611fa93-e1a2-497c-8732-853ba16dd84d","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Winter , P 1985 , ' An Algorithm for the Steiner Problem in the Euclidean Plane ' , Networks , vol. 15 , no. 3 , pp. 323-345 . https://doi.org/10.1002/net.3230150305","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":13,"referenced_works":["https://openalex.org/W1528622396","https://openalex.org/W1655990431","https://openalex.org/W1977726270","https://openalex.org/W1990488643","https://openalex.org/W2022150791","https://openalex.org/W2026745357","https://openalex.org/W2060380213","https://openalex.org/W2086709935","https://openalex.org/W2094076885","https://openalex.org/W2116935655","https://openalex.org/W2156503228","https://openalex.org/W2564511534","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2161182859","https://openalex.org/W2118320476","https://openalex.org/W1503036335","https://openalex.org/W2011703460","https://openalex.org/W1992380975","https://openalex.org/W2080581853","https://openalex.org/W3201893458","https://openalex.org/W4238206434","https://openalex.org/W2897501241","https://openalex.org/W187561811"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"algorithm":[2,64],"for":[3],"the":[4,8,12,30,50],"exact":[5],"solution":[6],"of":[7,32,41],"Steiner":[9,43,51],"problem":[10],"in":[11,25],"Euclidean":[13],"plane":[14],"is":[15,34,54],"presented.":[16],"Compared":[17],"with":[18],"earlier":[19],"algorithms,":[20],"it":[21],"generates":[22],"full":[23,42],"topologies":[24],"a":[26,38],"different":[27],"manner":[28],"whereby":[29],"number":[31,40],"computations":[33],"substantially":[35],"reduced.":[36],"Furthermore,":[37],"large":[39],"trees":[44],"which":[45],"do":[46],"not":[47],"belong":[48],"to":[49,66],"minimal":[52],"tree":[53],"identified":[55],"and":[56,60],"discarded":[57],"by":[58],"new":[59],"efficient":[61],"tests.":[62],"The":[63],"appears":[65],"be":[67],"considerably":[68],"faster":[69],"than":[70],"any":[71],"other":[72],"existing":[73],"algorithm.":[74]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"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":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}