{"id":"https://openalex.org/W2062404301","doi":"https://doi.org/10.1007/pl00009170","title":"On Constructing Minimum Spanning Trees in R k 1","display_name":"On Constructing Minimum Spanning Trees in R k 1","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2062404301","doi":"https://doi.org/10.1007/pl00009170","mag":"2062404301"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009170","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009170","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/A5077744897","display_name":"Sergei Bespamyatnikh","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102461","display_name":"Ural State University of Economics","ror":"https://ror.org/00zb26x20","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210102461"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"S. N. Bespamyatnikh","raw_affiliation_strings":["Department of Mathematics and Mechanics, Ural State University, 51 Lenin St., Ekaterinburg 620083, Russia. Sergei.Bespamyatnikh@usu.ru., , , , , , RU","Department of Mathematics and Mechanics, Ural State University, 51 Lenin St., Ekaterinburg 620083, Russia. Sergei.Bespamyatnikh@usu.ru., RU"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Mechanics, Ural State University, 51 Lenin St., Ekaterinburg 620083, Russia. Sergei.Bespamyatnikh@usu.ru., , , , , , RU","institution_ids":["https://openalex.org/I4210102461"]},{"raw_affiliation_string":"Department of Mathematics and Mechanics, Ural State University, 51 Lenin St., Ekaterinburg 620083, Russia. Sergei.Bespamyatnikh@usu.ru., RU","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077744897"],"corresponding_institution_ids":["https://openalex.org/I4210102461"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.7293,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.71255507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":"4","first_page":"524","last_page":"529"},"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.9962000250816345,"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.9962000250816345,"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.9925000071525574,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9887999892234802,"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.8327264785766602},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7170242667198181},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6684483885765076},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5759772658348083},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5197020173072815},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4418385922908783},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4289305806159973},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4111427664756775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34088021516799927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12157583236694336}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8327264785766602},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7170242667198181},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6684483885765076},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5759772658348083},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5197020173072815},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4418385922908783},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4289305806159973},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4111427664756775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34088021516799927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12157583236694336},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/pl00009170","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009170","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.34.3475","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.3475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/~besp/tree.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1979109797","https://openalex.org/W1982512167","https://openalex.org/W2007610503","https://openalex.org/W2031671531","https://openalex.org/W2035622528","https://openalex.org/W2048422125"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}