{"id":"https://openalex.org/W4411446067","doi":"https://doi.org/10.1007/978-981-96-8295-9_32","title":"Fast Approximation Algorithm for\u00a0Euclidean Minimum Spanning Tree Building in\u00a0High Dimensions","display_name":"Fast Approximation Algorithm for\u00a0Euclidean Minimum Spanning Tree Building in\u00a0High Dimensions","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4411446067","doi":"https://doi.org/10.1007/978-981-96-8295-9_32"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-96-8295-9_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-96-8295-9_32","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109063127","display_name":"K. Kido","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Keito Kido","raw_affiliation_strings":["The University of Osaka, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Osaka, Osaka, Japan","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009228302","display_name":"Daichi Amagata","orcid":"https://orcid.org/0000-0001-8571-4931"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daichi Amagata","raw_affiliation_strings":["The University of Osaka, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Osaka, Osaka, Japan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012025870","display_name":"Takahiro Hara","orcid":"https://orcid.org/0000-0003-4807-3156"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takahiro Hara","raw_affiliation_strings":["The University of Osaka, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Osaka, Osaka, Japan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109063127"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.5475,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.94706474,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"432","last_page":"443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7713643312454224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6880106925964355},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5772926807403564},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5724881887435913},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5533202886581421},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5198615193367004},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4523122012615204},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45106226205825806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.433488667011261},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4122008681297302},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28944307565689087},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22453582286834717},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18752655386924744},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09795588254928589}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7713643312454224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6880106925964355},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5772926807403564},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5724881887435913},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5533202886581421},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5198615193367004},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4523122012615204},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45106226205825806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.433488667011261},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4122008681297302},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28944307565689087},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22453582286834717},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18752655386924744},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09795588254928589}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-981-96-8295-9_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-96-8295-9_32","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1996064221","https://openalex.org/W2007339694","https://openalex.org/W2007610503","https://openalex.org/W2017927472","https://openalex.org/W2031671531","https://openalex.org/W2067298033","https://openalex.org/W2110026675","https://openalex.org/W2120636855","https://openalex.org/W2250539671","https://openalex.org/W2955791290","https://openalex.org/W2963265099","https://openalex.org/W2963469388","https://openalex.org/W3008588639","https://openalex.org/W3028420199","https://openalex.org/W3169714987","https://openalex.org/W3175358558","https://openalex.org/W3196483145","https://openalex.org/W3212741086","https://openalex.org/W4210466590","https://openalex.org/W4231737678","https://openalex.org/W4318899033","https://openalex.org/W4376639589","https://openalex.org/W4390575676","https://openalex.org/W4403716461","https://openalex.org/W6682335648"],"related_works":["https://openalex.org/W1561849181","https://openalex.org/W2943635264","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3081212354","https://openalex.org/W2059360098","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W2381121915","https://openalex.org/W3016811403"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}