{"id":"https://openalex.org/W2011014777","doi":"https://doi.org/10.1007/bf01188713","title":"Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors","display_name":"Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2011014777","doi":"https://doi.org/10.1007/bf01188713","mag":"2011014777"},"language":"en","primary_location":{"id":"doi:10.1007/bf01188713","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01188713","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/A5039161058","display_name":"Young Cheul Wee","orcid":null},"institutions":[{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]},{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y. C. Wee","raw_affiliation_strings":["Department of Computer Science, State University of New York, 12222, Albany, NY, USA","Department of Computer Science, State University of New York, Albany, USA 12222#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, 12222, Albany, NY, USA","institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"]},{"raw_affiliation_string":"Department of Computer Science, State University of New York, Albany, USA 12222#TAB#","institution_ids":["https://openalex.org/I392282"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048801918","display_name":"Seth Chaiken","orcid":null},"institutions":[{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]},{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Chaiken","raw_affiliation_strings":["Department of Computer Science, State University of New York, 12222, Albany, NY, USA","Department of Computer Science, State University of New York, Albany, USA 12222#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, 12222, Albany, NY, USA","institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"]},{"raw_affiliation_string":"Department of Computer Science, State University of New York, Albany, USA 12222#TAB#","institution_ids":["https://openalex.org/I392282"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086740853","display_name":"S. S. Ravi","orcid":"https://orcid.org/0000-0002-0893-4364"},"institutions":[{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]},{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. S. Ravi","raw_affiliation_strings":["Department of Computer Science, State University of New York, 12222, Albany, NY, USA","Department of Computer Science, State University of New York, Albany, USA 12222#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, 12222, Albany, NY, USA","institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"]},{"raw_affiliation_string":"Department of Computer Science, State University of New York, Albany, USA 12222#TAB#","institution_ids":["https://openalex.org/I392282"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.4524,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.63248639,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":"6","first_page":"421","last_page":"435"},"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.9997000098228455,"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.9997000098228455,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.984499990940094,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9843000173568726,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7381669282913208},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7315943241119385},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7284876704216003},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7143500447273254},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6287013292312622},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5846521854400635},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.4936455488204956},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4639515280723572},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4384728670120239},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42193326354026794},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.42090755701065063},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4174744188785553},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4133360981941223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3730486035346985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23259568214416504},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20225492119789124},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.19942811131477356},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13812628388404846},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06460276246070862}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7381669282913208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7315943241119385},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7284876704216003},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7143500447273254},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6287013292312622},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5846521854400635},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.4936455488204956},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4639515280723572},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4384728670120239},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42193326354026794},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.42090755701065063},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4174744188785553},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4133360981941223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3730486035346985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23259568214416504},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20225492119789124},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.19942811131477356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13812628388404846},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06460276246070862},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01188713","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01188713","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W148432699","https://openalex.org/W1513400187","https://openalex.org/W1536593431","https://openalex.org/W1968721698","https://openalex.org/W1975140409","https://openalex.org/W1987225278","https://openalex.org/W1989409580","https://openalex.org/W2011039300","https://openalex.org/W2016582666","https://openalex.org/W2029437526","https://openalex.org/W2031671531","https://openalex.org/W2036114412","https://openalex.org/W2042492403","https://openalex.org/W2042607215","https://openalex.org/W2057941709","https://openalex.org/W2060561062","https://openalex.org/W2060978628","https://openalex.org/W2063295648","https://openalex.org/W2077572687","https://openalex.org/W2082293426","https://openalex.org/W2084224084","https://openalex.org/W2088848545","https://openalex.org/W2092569613","https://openalex.org/W2094398774","https://openalex.org/W2120104755","https://openalex.org/W2128703518","https://openalex.org/W2134165468","https://openalex.org/W2171694703","https://openalex.org/W3152126650","https://openalex.org/W4285719527","https://openalex.org/W6606887814"],"related_works":["https://openalex.org/W2081066931","https://openalex.org/W620960161","https://openalex.org/W2513418505","https://openalex.org/W2045244794","https://openalex.org/W2911818503","https://openalex.org/W1576317141","https://openalex.org/W2621339359","https://openalex.org/W1958279402","https://openalex.org/W4390962175","https://openalex.org/W2039611868"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}