{"id":"https://openalex.org/W2058250759","doi":"https://doi.org/10.1007/pl00009287","title":"Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem","display_name":"Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem","publication_year":1999,"publication_date":"1999-08-01","ids":{"openalex":"https://openalex.org/W2058250759","doi":"https://doi.org/10.1007/pl00009287","mag":"2058250759"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009287","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009287","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/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"]},{"id":"https://openalex.org/I4210140904","display_name":"DK4","ror":"https://ror.org/041xgzk22","country_code":"DK","type":"other","lineage":["https://openalex.org/I4210140904"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"M. Zachariasen","raw_affiliation_strings":["Department of Computer Science,  University of Copenhagen, DK-2100 Copenhagen \u00d8,  Denmark.   martinz@diku.dk,   pawel@diku.dk., , , , , , DK","Department of Computer Science,  University of Copenhagen, DK-2100 Copenhagen \u00d8,  Denmark.   martinz@diku.dk,   pawel@diku.dk., , DK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  University of Copenhagen, DK-2100 Copenhagen \u00d8,  Denmark.   martinz@diku.dk,   pawel@diku.dk., , , , , , DK","institution_ids":["https://openalex.org/I4210140904"]},{"raw_affiliation_string":"Department of Computer Science,  University of Copenhagen, DK-2100 Copenhagen \u00d8,  Denmark.   martinz@diku.dk,   pawel@diku.dk., , DK","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"]},{"id":"https://openalex.org/I4210140904","display_name":"DK4","ror":"https://ror.org/041xgzk22","country_code":"DK","type":"other","lineage":["https://openalex.org/I4210140904"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"P. Winter","raw_affiliation_strings":["Department of Computer Science,  University of Copenhagen, DK-2100 Copenhagen \u00d8,  Denmark.   martinz@diku.dk,   pawel@diku.dk., , , , , , DK","Department of Computer Science,  University of Copenhagen, DK-2100 Copenhagen \u00d8,  Denmark.   martinz@diku.dk,   pawel@diku.dk., , DK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  University of Copenhagen, DK-2100 Copenhagen \u00d8,  Denmark.   martinz@diku.dk,   pawel@diku.dk., , , , , , DK","institution_ids":["https://openalex.org/I4210140904"]},{"raw_affiliation_string":"Department of Computer Science,  University of Copenhagen, DK-2100 Copenhagen \u00d8,  Denmark.   martinz@diku.dk,   pawel@diku.dk., , DK","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057902603"],"corresponding_institution_ids":["https://openalex.org/I124055696","https://openalex.org/I4210140904"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.9389,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.7570356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"4","first_page":"418","last_page":"437"},"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.9990000128746033,"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.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9927999973297119,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9904000163078308,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8395260572433472},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7282465696334839},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7230837941169739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6236470937728882},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.5887718200683594},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5536935925483704},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.5299965739250183},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5120170712471008},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.5041512250900269},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4795510470867157},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.46542638540267944},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46123266220092773},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4577334225177765},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.31013914942741394},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29223912954330444},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.24664872884750366},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10129272937774658}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8395260572433472},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7282465696334839},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7230837941169739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6236470937728882},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5887718200683594},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5536935925483704},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.5299965739250183},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5120170712471008},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.5041512250900269},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4795510470867157},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.46542638540267944},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46123266220092773},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4577334225177765},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.31013914942741394},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29223912954330444},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.24664872884750366},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10129272937774658},{"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.1007/pl00009287","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009287","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.7750","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.7750","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.diku.dk/publikationer/tekniske.rapporter/1997/97-20.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/05fba980-6558-11de-8bc9-000ea68e967b","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/05fba980-6558-11de-8bc9-000ea68e967b","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":"Zachariasen , M & Winter , P 1998 , Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem . in publisher . pp. 144-153 , Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem , 29/11/2010 .","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1513400187","https://openalex.org/W1976925751","https://openalex.org/W2011065039","https://openalex.org/W2014068360","https://openalex.org/W2021517364","https://openalex.org/W2022150791","https://openalex.org/W2022563199","https://openalex.org/W2025638429","https://openalex.org/W2042477130","https://openalex.org/W2044861278","https://openalex.org/W2049967755","https://openalex.org/W2053792000","https://openalex.org/W2063295648","https://openalex.org/W2070308700","https://openalex.org/W2088172021","https://openalex.org/W2110367141","https://openalex.org/W2113174871","https://openalex.org/W2149509209","https://openalex.org/W2156153879"],"related_works":["https://openalex.org/W1978034843","https://openalex.org/W2911928093","https://openalex.org/W2183553443","https://openalex.org/W2739242419","https://openalex.org/W2144570496","https://openalex.org/W27726302","https://openalex.org/W2513418505","https://openalex.org/W2134202573","https://openalex.org/W2487959332","https://openalex.org/W2058250759"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}