{"id":"https://openalex.org/W2085143999","doi":"https://doi.org/10.1007/bf02067243","title":"Steiner minimal trees for three points with one convex polygonal obstacle","display_name":"Steiner minimal trees for three points with one convex polygonal obstacle","publication_year":1991,"publication_date":"1991-07-01","ids":{"openalex":"https://openalex.org/W2085143999","doi":"https://doi.org/10.1007/bf02067243","mag":"2085143999"},"language":"en","primary_location":{"id":"doi:10.1007/bf02067243","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02067243","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","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":false,"raw_author_name":"Pawel Winter","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, DK-2100, Copenhagen \u00d8, Denmark","Department of Computer Science, University of Copenhagen, Copenhagen\u00a0\u00d8, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, DK-2100, Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen\u00a0\u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101974532","display_name":"J. MacGregor Smith","orcid":"https://orcid.org/0000-0002-6147-5806"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. MacGregor Smith","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of Massachusetts, 01003, Amherst, MA, USA","Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of Massachusetts, 01003, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.7282,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.70600414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"33","issue":"7","first_page":"577","last_page":"599"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9975000023841858,"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.774061918258667},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7166863083839417},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.7068212628364563},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6391535997390747},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.573774516582489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5647504925727844},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5171388983726501},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5063599348068237},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4375779926776886},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.428462952375412},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39840781688690186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.389875203371048},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37208130955696106},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12159004807472229}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.774061918258667},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7166863083839417},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.7068212628364563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6391535997390747},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.573774516582489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5647504925727844},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5171388983726501},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5063599348068237},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4375779926776886},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.428462952375412},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39840781688690186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.389875203371048},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37208130955696106},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12159004807472229},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02067243","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02067243","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1975807353","https://openalex.org/W1976925751","https://openalex.org/W2005314985","https://openalex.org/W2011039300","https://openalex.org/W2022150791","https://openalex.org/W2042492403","https://openalex.org/W2071945466","https://openalex.org/W2086709935","https://openalex.org/W2172222998","https://openalex.org/W2498335479","https://openalex.org/W2911302472","https://openalex.org/W3148632216","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2161182859","https://openalex.org/W2118320476","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2054452185","https://openalex.org/W2011703460","https://openalex.org/W1992380975","https://openalex.org/W2080581853","https://openalex.org/W3201893458"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}