{"id":"https://openalex.org/W2912516824","doi":"https://doi.org/10.1007/s00453-017-0292-6","title":"Minimizing the Diameter of a Spanning Tree for Imprecise Points","display_name":"Minimizing the Diameter of a Spanning Tree for Imprecise Points","publication_year":2017,"publication_date":"2017-02-23","ids":{"openalex":"https://openalex.org/W2912516824","doi":"https://doi.org/10.1007/s00453-017-0292-6","mag":"2912516824"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-017-0292-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-017-0292-6","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/A5008771140","display_name":"Chih-Hung Liu","orcid":"https://orcid.org/0000-0001-9683-5982"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["CH","DE"],"is_corresponding":true,"raw_author_name":"Chih-Hung Liu","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland","Department of Computer Science, University of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Department of Computer Science, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036187082","display_name":"Sandro Montanari","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Sandro Montanari","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008771140"],"corresponding_institution_ids":["https://openalex.org/I135140700","https://openalex.org/I35440088"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.34853183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"80","issue":"2","first_page":"801","last_page":"826"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9951000213623047,"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/combinatorics","display_name":"Combinatorics","score":0.7866498827934265},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.728272020816803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7228123545646667},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5574566721916199},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.474173903465271},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47127765417099},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4671589434146881},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4404720962047577},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43580538034439087},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.43478071689605713},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4270690679550171},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.42353928089141846},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4230932295322418},{"id":"https://openalex.org/keywords/unit-square","display_name":"Unit square","score":0.4134235084056854},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.4130246341228485},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37164071202278137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.273335337638855},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2708784341812134},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.23802536725997925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17104750871658325},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1695566475391388},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14346227049827576},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14064475893974304}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7866498827934265},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.728272020816803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7228123545646667},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5574566721916199},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.474173903465271},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47127765417099},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4671589434146881},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4404720962047577},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43580538034439087},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.43478071689605713},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4270690679550171},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.42353928089141846},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4230932295322418},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.4134235084056854},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.4130246341228485},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37164071202278137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.273335337638855},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2708784341812134},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.23802536725997925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17104750871658325},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1695566475391388},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14346227049827576},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14064475893974304},{"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/s00453-017-0292-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-017-0292-6","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":36,"referenced_works":["https://openalex.org/W44696363","https://openalex.org/W1481075119","https://openalex.org/W1559408176","https://openalex.org/W1589450195","https://openalex.org/W1885878332","https://openalex.org/W1972925770","https://openalex.org/W1981114840","https://openalex.org/W1985149601","https://openalex.org/W1995864174","https://openalex.org/W2007553965","https://openalex.org/W2036493899","https://openalex.org/W2041094480","https://openalex.org/W2042179241","https://openalex.org/W2050284373","https://openalex.org/W2058432138","https://openalex.org/W2074863496","https://openalex.org/W2086252334","https://openalex.org/W2102170762","https://openalex.org/W2105865143","https://openalex.org/W2105946172","https://openalex.org/W2116168038","https://openalex.org/W2124064239","https://openalex.org/W2132445073","https://openalex.org/W2139225572","https://openalex.org/W2147026670","https://openalex.org/W2163294576","https://openalex.org/W2397281024","https://openalex.org/W2569091092","https://openalex.org/W3098888827","https://openalex.org/W4210881201","https://openalex.org/W4234195146","https://openalex.org/W4242246215","https://openalex.org/W4243089799","https://openalex.org/W4254977685","https://openalex.org/W4300926135","https://openalex.org/W6630961013"],"related_works":["https://openalex.org/W3187208706","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W1561849181","https://openalex.org/W2943635264","https://openalex.org/W3081212354","https://openalex.org/W3016811403","https://openalex.org/W98489388","https://openalex.org/W2390742649","https://openalex.org/W3099328339"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}