{"id":"https://openalex.org/W2002985966","doi":"https://doi.org/10.1007/s00454-004-1117-3","title":"Euclidean Bounded-Degree Spanning Tree Ratios","display_name":"Euclidean Bounded-Degree Spanning Tree Ratios","publication_year":2004,"publication_date":"2004-05-27","ids":{"openalex":"https://openalex.org/W2002985966","doi":"https://doi.org/10.1007/s00454-004-1117-3","mag":"2002985966"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-004-1117-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-004-1117-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-004-1117-3.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-004-1117-3.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032955418","display_name":"Timothy M. Chan","orcid":"https://orcid.org/0000-0002-8093-0675"},"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":"Timothy M. Chan","raw_affiliation_strings":["School of Computer Science,\n  University of Waterloo, Waterloo, Ontario,  N2L 3G1, Canada","School of Computer Science,#N#  University of Waterloo, Waterloo, Ontario,  N2L 3G1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science,\n  University of Waterloo, Waterloo, Ontario,  N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"School of Computer Science,#N#  University of Waterloo, Waterloo, Ontario,  N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032955418"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.9549,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.8758372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":"2","first_page":null,"last_page":null},"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.9987000226974487,"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.9987000226974487,"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/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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9966999888420105,"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/mathematics","display_name":"Mathematics","score":0.8522601127624512},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8314929008483887},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8101351261138916},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6710143089294434},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.650122880935669},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.636001467704773},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6347401142120361},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.5723292231559753},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5717196464538574},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5680907964706421},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4902413487434387},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.48378321528434753},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.436423122882843},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3928205370903015},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.13747963309288025},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.09201985597610474},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07116875052452087},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.059343039989471436},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.055127888917922974}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8522601127624512},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8314929008483887},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8101351261138916},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6710143089294434},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.650122880935669},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.636001467704773},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6347401142120361},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.5723292231559753},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5717196464538574},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5680907964706421},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4902413487434387},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.48378321528434753},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.436423122882843},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3928205370903015},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.13747963309288025},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.09201985597610474},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07116875052452087},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.059343039989471436},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.055127888917922974},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00454-004-1117-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-004-1117-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-004-1117-3.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00454-004-1117-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-004-1117-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-004-1117-3.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2002985966.pdf","grobid_xml":"https://content.openalex.org/works/W2002985966.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1520111182","https://openalex.org/W1527583442","https://openalex.org/W1552092932","https://openalex.org/W1566313961","https://openalex.org/W1600533941","https://openalex.org/W1965398738","https://openalex.org/W1975656597","https://openalex.org/W1994248285","https://openalex.org/W1998141189","https://openalex.org/W2022179164","https://openalex.org/W2022563199","https://openalex.org/W2024833542","https://openalex.org/W2056839231","https://openalex.org/W2063807274","https://openalex.org/W2088839217","https://openalex.org/W2113947299","https://openalex.org/W2165142526","https://openalex.org/W2602800732","https://openalex.org/W3099328339","https://openalex.org/W3145128584","https://openalex.org/W3183881215","https://openalex.org/W4285719527","https://openalex.org/W6643707094"],"related_works":["https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W2059360098","https://openalex.org/W98489388","https://openalex.org/W2058332489","https://openalex.org/W3187208706","https://openalex.org/W2943635264","https://openalex.org/W3099328339","https://openalex.org/W1561849181","https://openalex.org/W2523915986"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}