{"id":"https://openalex.org/W2487959332","doi":"https://doi.org/10.1007/978-3-319-38851-9_15","title":"Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances","display_name":"Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2487959332","doi":"https://doi.org/10.1007/978-3-319-38851-9_15","mag":"2487959332"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-38851-9_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-38851-9_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://curis.ku.dk/ws/files/167477090/Lorenzen_2016_Bottleneck_distances.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071175348","display_name":"Stephan Sloth Lorenzen","orcid":"https://orcid.org/0000-0001-6701-3752"},"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":"Stephan S. Lorenzen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen O, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen O, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","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, Universitetsparken 5, 2100, Copenhagen O, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen O, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071175348"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0351,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72467565,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"217","last_page":"230"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9950000047683716,"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.790919303894043},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7903586030006409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7505170106887817},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6589133739471436},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5485842227935791},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.529392421245575},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.48177000880241394},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4707408845424652},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4143370985984802},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3600083589553833},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3591560423374176},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34528613090515137},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24774295091629028},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18953296542167664},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.083916574716568},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07931908965110779}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.790919303894043},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7903586030006409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7505170106887817},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6589133739471436},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5485842227935791},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.529392421245575},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.48177000880241394},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4707408845424652},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4143370985984802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3600083589553833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3591560423374176},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34528613090515137},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24774295091629028},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18953296542167664},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.083916574716568},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07931908965110779},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-38851-9_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-38851-9_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/6c4dee49-49aa-45b6-a728-310aad8beb01","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/6c4dee49-49aa-45b6-a728-310aad8beb01","pdf_url":"https://curis.ku.dk/ws/files/167477090/Lorenzen_2016_Bottleneck_distances.pdf","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":"Lorenzen , S S & Winter , P 2016 , Steiner tree heuristic in the Euclidean d-space using bottleneck distances . in A V Goldberg & A S Kulikov (eds) , Experimental Algorithms : 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings . Springer , Lecture notes in computer science , vol. 9685 , pp. 217-230 , 15th International Symposium on Experimental Algorithms , St. Petersborg , Russian Federation , 05/06/2016 . https://doi.org/10.1007/978-3-319-38851-9_15","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/6c4dee49-49aa-45b6-a728-310aad8beb01","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/steiner-tree-heuristic-in-the-euclidean-dspace-using-bottleneck-distances(6c4dee49-49aa-45b6-a728-310aad8beb01).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":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/6c4dee49-49aa-45b6-a728-310aad8beb01","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/6c4dee49-49aa-45b6-a728-310aad8beb01","pdf_url":"https://curis.ku.dk/ws/files/167477090/Lorenzen_2016_Bottleneck_distances.pdf","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":"Lorenzen , S S & Winter , P 2016 , Steiner tree heuristic in the Euclidean d-space using bottleneck distances . in A V Goldberg & A S Kulikov (eds) , Experimental Algorithms : 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings . Springer , Lecture notes in computer science , vol. 9685 , pp. 217-230 , 15th International Symposium on Experimental Algorithms , St. Petersborg , Russian Federation , 05/06/2016 . https://doi.org/10.1007/978-3-319-38851-9_15","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2487959332.pdf","grobid_xml":"https://content.openalex.org/works/W2487959332.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1508240458","https://openalex.org/W1937025243","https://openalex.org/W1957367111","https://openalex.org/W1983276997","https://openalex.org/W1989550031","https://openalex.org/W1990179360","https://openalex.org/W1992380975","https://openalex.org/W1995356291","https://openalex.org/W2018804864","https://openalex.org/W2022150791","https://openalex.org/W2025638429","https://openalex.org/W2071857538","https://openalex.org/W2086709935","https://openalex.org/W2088501747","https://openalex.org/W2088967712","https://openalex.org/W2149906774","https://openalex.org/W2274076436","https://openalex.org/W2601582571","https://openalex.org/W2603633927","https://openalex.org/W4239626474","https://openalex.org/W4251391716"],"related_works":["https://openalex.org/W2011703460","https://openalex.org/W2080581853","https://openalex.org/W4286959400","https://openalex.org/W1992380975","https://openalex.org/W3201893458","https://openalex.org/W2090152127","https://openalex.org/W1965169884","https://openalex.org/W2008939113","https://openalex.org/W3125580510","https://openalex.org/W2105228010"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}