{"id":"https://openalex.org/W2086252334","doi":"https://doi.org/10.1007/s00453-003-1056-z","title":"Computing a (1+\u03b5)-Approximate Geometric Minimum-Diameter Spanning Tree","display_name":"Computing a (1+\u03b5)-Approximate Geometric Minimum-Diameter Spanning Tree","publication_year":2003,"publication_date":"2003-12-05","ids":{"openalex":"https://openalex.org/W2086252334","doi":"https://doi.org/10.1007/s00453-003-1056-z","mag":"2086252334"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-003-1056-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1056-z","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/A5019189356","display_name":"Michael J. Spriggs","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Michael J. Spriggs","raw_affiliation_strings":["School of Computer Science, University of \nWaterloo, 200 University Avenue West, Waterloo, Ontario, \nN2L 3G1, Canada","School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of \nWaterloo, 200 University Avenue West, Waterloo, Ontario, \nN2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043506071","display_name":"Julian Keil","orcid":"https://orcid.org/0000-0002-5284-2002"},"institutions":[{"id":"https://openalex.org/I32625721","display_name":"University of Saskatchewan","ror":"https://ror.org/010x8gc63","country_code":"CA","type":"education","lineage":["https://openalex.org/I32625721"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Mark Keil","raw_affiliation_strings":["Department  of\nComputer  Science, University  of  Saskatchewan,  Saskatoon, Saskatchewan,  \nS7N 5A9, Canada","Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan S7N 5A9, Canada"],"affiliations":[{"raw_affiliation_string":"Department  of\nComputer  Science, University  of  Saskatchewan,  Saskatoon, Saskatchewan,  \nS7N 5A9, Canada","institution_ids":["https://openalex.org/I32625721"]},{"raw_affiliation_string":"Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan S7N 5A9, Canada","institution_ids":["https://openalex.org/I32625721"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077744897","display_name":"Sergei Bespamyatnikh","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sergei Bespamyatnikh","raw_affiliation_strings":["Department of Computer Science, Duke University, Box 90129, Durham, NC 27708, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Box 90129, Durham, NC 27708, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042337532","display_name":"Michael Segal","orcid":"https://orcid.org/0000-0001-7606-6522"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Segal","raw_affiliation_strings":["Communication Systems Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel","Communication Systems Engineering Department, Ben-Gurion University of The Negev, Beer-Sheva 84105, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Communication Systems Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Communication Systems Engineering Department, Ben-Gurion University of The Negev, Beer-Sheva 84105, Israel#TAB#","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074061303","display_name":"Jack Snoeyink","orcid":"https://orcid.org/0000-0002-3887-4008"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jack Snoeyink","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175, USA","Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175, USA","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175 USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5019189356"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3476,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.70826307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"4","first_page":"577","last_page":"589"},"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.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7534540295600891},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7530238628387451},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7284452319145203},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6306531429290771},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5758465528488159},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5590283870697021},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48571664094924927},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.47654229402542114},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.4698658883571625},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4664340317249298},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4452744126319885},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.422394335269928},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4210665822029114},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.41853976249694824},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4121477007865906},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.39724403619766235},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3167293071746826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2707405984401703},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20156845450401306},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.15242856740951538},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12988698482513428},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12665429711341858}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7534540295600891},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7530238628387451},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7284452319145203},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6306531429290771},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5758465528488159},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5590283870697021},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48571664094924927},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.47654229402542114},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.4698658883571625},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4664340317249298},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4452744126319885},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.422394335269928},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4210665822029114},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.41853976249694824},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4121477007865906},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.39724403619766235},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3167293071746826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2707405984401703},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20156845450401306},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.15242856740951538},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12988698482513428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12665429711341858},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/s00453-003-1056-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1056-z","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":12,"referenced_works":["https://openalex.org/W1552092932","https://openalex.org/W1984953641","https://openalex.org/W1985149601","https://openalex.org/W2004681879","https://openalex.org/W2034834234","https://openalex.org/W2054011861","https://openalex.org/W2072970829","https://openalex.org/W2076265641","https://openalex.org/W2105865143","https://openalex.org/W2153586414","https://openalex.org/W4239852074","https://openalex.org/W6601597184"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W1978034843","https://openalex.org/W620960161","https://openalex.org/W2183553443","https://openalex.org/W2911818503","https://openalex.org/W2113286397","https://openalex.org/W1754127855","https://openalex.org/W130518292"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}