{"id":"https://openalex.org/W2022150791","doi":"https://doi.org/10.1002/net.3230110104","title":"An O(<i>n</i> log <i>n</i>) heuristic for steiner minimal tree problems on the euclidean metric","display_name":"An O(<i>n</i> log <i>n</i>) heuristic for steiner minimal tree problems on the euclidean metric","publication_year":1981,"publication_date":"1981-03-01","ids":{"openalex":"https://openalex.org/W2022150791","doi":"https://doi.org/10.1002/net.3230110104","mag":"2022150791"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230110104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110104","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/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, Amherst, Massachusetts 01003","Department of Industrial Engineering and Operations Research University of Massachusetts \u2022 Amherst, Massachusetts 01003"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, Massachusetts 01003","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research University of Massachusetts \u2022 Amherst, Massachusetts 01003","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113687731","display_name":"D. T. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. T. Lee","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois 60201","Department of Electrical Engineering and Computer Science Northwestern University Evanston, Illinois 60201"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois 60201","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science Northwestern University Evanston, Illinois 60201","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109807254","display_name":"Judith S. Liebman","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Judith S. Liebman","raw_affiliation_strings":["Operations Research Laboratory, Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois 61801"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Laboratory, Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois 61801","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.5679,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.68894009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"11","issue":"1","first_page":"23","last_page":"39"},"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.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"}},"topics":[{"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9973000288009644,"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.991100013256073,"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/combinatorics","display_name":"Combinatorics","score":0.7955845594406128},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7067779302597046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6982051134109497},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6223073601722717},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5890355110168457},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.5708603262901306},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5351081490516663},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5201392769813538},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.4698834717273712},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.45286744832992554},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3740062117576599},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36357343196868896},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.19585588574409485},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13980108499526978}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7955845594406128},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7067779302597046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6982051134109497},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6223073601722717},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5890355110168457},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.5708603262901306},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5351081490516663},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5201392769813538},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.4698834717273712},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.45286744832992554},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3740062117576599},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36357343196868896},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.19585588574409485},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13980108499526978},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230110104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110104","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W633187045","https://openalex.org/W1655990431","https://openalex.org/W1976925751","https://openalex.org/W1990488643","https://openalex.org/W2042477130","https://openalex.org/W2048901266","https://openalex.org/W2060380213","https://openalex.org/W2064791171","https://openalex.org/W2082293426","https://openalex.org/W2085655777","https://openalex.org/W2086709935","https://openalex.org/W2094076885","https://openalex.org/W2128865241","https://openalex.org/W2138833078","https://openalex.org/W2143037347","https://openalex.org/W2157700603","https://openalex.org/W2294603245","https://openalex.org/W2590190460"],"related_works":["https://openalex.org/W1561849181","https://openalex.org/W3187208706","https://openalex.org/W3081212354","https://openalex.org/W98489388","https://openalex.org/W3099328339","https://openalex.org/W1587959445","https://openalex.org/W1985149601","https://openalex.org/W3101281637","https://openalex.org/W1703428550","https://openalex.org/W1964611452"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"O":[2,89,98,108,121,145],"(":[3,90,99,109,122,146],"n":[4,6,91,93,100,110,112,123,147],"log":[5,92,111],")":[7,94,102,113,125,149],"heuristic":[8],"for":[9],"the":[10,30,36,41,49,58,79,88,107,119,131,135,144],"Euclidean":[11],"Steiner":[12,43,154],"Minimal":[13,44],"Tree":[14,45,55],"(ESMT)":[15],"problem":[16],"is":[17,21,115,140],"presented.":[18],"The":[19,61],"algorithm":[20,63,95,103,114,126,150],"based":[22],"on":[23,70],"a":[24,71,83],"decomposition":[25],"approach":[26],"which":[27],"first":[28],"partitions":[29],"vertex":[31,137],"set":[32],"into":[33],"triangles":[34],"via":[35],"Delaunay":[37],"triangulation,":[38],"then":[39],"\u201crecomposes\u201d":[40],"suboptimal":[42],"(SMT)":[46],"according":[47],"to":[48],"Voronoi":[50],"diagram":[51],"and":[52,68,156],"Minimum":[53],"Spanning":[54],"(MST)":[56],"of":[57,73,87,134],"point":[59,76],"set.":[60,138],"ESMT":[62],"was":[64],"implemented":[65],"in":[66,78,127,130],"FORTRAN\u2010IV":[67],"tested":[69],"number":[72],"randomly":[74],"generated":[75],"sets":[77],"plane":[80],"drawn":[81],"from":[82],"uniform":[84],"distribution.":[85],"Comparison":[86],"with":[96],"an":[97],"4":[101,124,148],"clearly":[104],"indicates":[105],"that":[106],"as":[116,118],"good":[117],"previous":[120],"achieving":[128],"reductions":[129],"ratio":[132],"SMT/MST":[133],"given":[136],"This":[139],"somewhat":[141],"surprising":[142],"since":[143],"considers":[151],"more":[152],"potential":[153],"points":[155],"alternative":[157],"tree":[158],"configurations.":[159]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}