{"id":"https://openalex.org/W7162574205","doi":"https://doi.org/10.4230/lipics.socg.2026.68","title":"Optimal Bounds for Spanners and Tree Covers in Doubling Metrics","display_name":"Optimal Bounds for Spanners and Tree Covers in Doubling Metrics","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162574205","doi":"https://doi.org/10.4230/lipics.socg.2026.68"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25875","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.68","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.68","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137089029","display_name":"An La","orcid":"https://orcid.org/0000-0001-7287-571X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"La, An","raw_affiliation_strings":["University of Massachusetts Amherst, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-7287-571X","affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137156764","display_name":"Hung Le","orcid":"https://orcid.org/0000-0001-8223-9944"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Le, Hung","raw_affiliation_strings":["University of Massachusetts Amherst, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8223-9944","affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084685735","display_name":"Shay Solomon","orcid":"https://orcid.org/0000-0003-2254-5100"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Solomon, Shay","raw_affiliation_strings":["Tel Aviv University, Israel"],"raw_orcid":"https://orcid.org/0000-0003-2254-5100","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122098619","display_name":"Cuong Than","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Than, Cuong","raw_affiliation_strings":["University of Massachusetts Amherst, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-7350-331X","affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137152558","display_name":"Vinayak","orcid":"https://orcid.org/0009-0005-3053-8631"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vinayak","raw_affiliation_strings":["University of Massachusetts Amherst, MA, USA"],"raw_orcid":"https://orcid.org/0009-0005-3053-8631","affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137134614","display_name":"Shuang Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang, Shuang","raw_affiliation_strings":["University of Massachusetts Amherst, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137161579","display_name":"Tianyi Zhang","orcid":"https://orcid.org/0000-0003-3407-3307"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhang, Tianyi","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"raw_orcid":"https://orcid.org/0000-0003-3407-3307","affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":7,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.87347492,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.8641999959945679,"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.8641999959945679,"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.05090000107884407,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.016300000250339508,"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/degree","display_name":"Degree (music)","score":0.6830000281333923},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.6545000076293945},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5595999956130981},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5343999862670898},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5324000120162964},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.47600001096725464},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.46470001339912415},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4627000093460083}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8169000148773193},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6836000084877014},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6830000281333923},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.6545000076293945},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5595999956130981},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5343999862670898},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5324000120162964},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.47600001096725464},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.46470001339912415},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4627000093460083},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4603999853134155},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44190001487731934},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4189999997615814},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4002000093460083},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C193601281","wikidata":"https://www.wikidata.org/wiki/Q19426","display_name":"Lightness","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2718999981880188}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25875","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.68","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.socg.2026.68","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.68","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25875","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.68","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"It":[0],"is":[1,251],"known":[2],"that":[3,215],"any":[4,30,61,76],"n-point":[5,70],"set":[6,71],"in":[7,48,55,72,99,189,246],"the":[8,53,93,108,132,162,178,190,216,229,256],"d-dimensional":[9],"Euclidean":[10,88],"space":[11],"\u211d^d,":[12,73,100],"for":[13,29,74,87,184],"d":[14,64],"=":[15,65],"O(1),":[16,66],"admits:":[17],"1)":[18,205],"A":[19,35,206,233],"(1+\u03b5)-spanner":[20,77],"with":[21,26,38,169,225,239,242,253],"maximum":[22,44,147,243,261],"degree":[23,45,148,244],"O\u0303(\u03b5^{-d+1})":[24],"and":[25,43,81,138,150,186,209,219,260],"lightness":[27,82,151],"O\u0303(\u03b5^{-d}),":[28],"\u03b5":[31],">":[32],"0.":[33],"2)":[34,232],"(1+\u03b5)-tree":[36,167,237],"cover":[37,168],"O\u0303(n":[39],"\u22c5":[40],"\u03b5^{-d+1})":[41],"trees":[42,259],"of":[46,96,111,117,146,161,176,180,193,236,258],"O(1)":[47,245],"each":[49,247],"tree.":[50,248],"Moreover,":[51,157],"all":[52,228],"parameters":[54],"these":[56],"constructions":[57],"are":[58,223],"optimal:":[59],"For":[60],"2":[62],"\u2264":[63],"there":[67],"exists":[68],"an":[69],"which":[75,101,213],"has":[78,135,196],"\u03a9\u0303(n\u22c5\u03b5^{-d+1})":[79],"edges":[80],"\u03a9\u0303(\u03b5^{-d}).":[83],"The":[84],"upper":[85],"bounds":[86,183],"spanners":[89,185],"rely":[90],"heavily":[91],"on":[92],"spatial":[94],"property":[95],"cone":[97],"partitioning":[98],"does":[102],"not":[103],"seem":[104],"to":[105,107,227,255],"extend":[106],"wider":[109,191],"family":[110,192],"doubling":[112,119,122,194],"metrics,":[113,123],"i.e.,":[114],"metric":[115],"spaces":[116],"constant":[118],"dimension.":[120],"In":[121],"a":[124,144,158,166,173],"simple":[125,208],"spanner":[126,145,164,218],"construction":[127,235,250],"from":[128],"two":[129],"decades":[130],"ago,":[131],"net-tree":[133,163,217],"spanner,":[134],"O\u0303(n\u22c5\u03b5^{-d})":[136,240],"edges,":[137],"it":[139],"could":[140],"be":[141],"transformed":[142],"into":[143],"O\u0303(\u03b5^{-d})":[149,170],"O\u0303(n\u22c5\u03b5^{-(d+1)})":[152],"by":[153,203],"pruning":[154],"redundant":[155],"edges.":[156],"careful":[159],"refinement":[160],"yields":[165],"trees.":[171],"Despite":[172],"large":[174],"body":[175],"work,":[177],"problem":[179,202],"obtaining":[181],"tight":[182,210],"tree":[187],"covers":[188,238],"metrics":[195],"remained":[197],"elusive.":[198],"We":[199],"resolve":[200],"this":[201],"presenting:":[204],"surprisingly":[207],"lower":[211],"bound,":[212],"shows":[214],"its":[220],"pruned":[221],"version":[222],"optimal":[224,252],"respect":[226,254],"involved":[230],"parameters.":[231],"new":[234],"trees,":[241],"This":[249],"number":[257],"degree.":[262]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-28T00:00:00"}