{"id":"https://openalex.org/W4417296845","doi":"https://doi.org/10.4230/lipics.socg.2026.71","title":"Approximating Euclidean Shallow-Light Trees","display_name":"Approximating Euclidean Shallow-Light Trees","publication_year":2025,"publication_date":"2025-12-11","ids":{"openalex":"https://openalex.org/W4417296845","doi":"https://doi.org/10.4230/lipics.socg.2026.71"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2512.10797","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.10797","pdf_url":"https://arxiv.org/pdf/2512.10797","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.10797","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050273950","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/A5050147589","display_name":"Cuong Than","orcid":"https://orcid.org/0000-0001-7350-331X"},"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/A5030799674","display_name":"Csaba D. T\u00f3th","orcid":"https://orcid.org/0000-0002-8769-3190"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]},{"id":"https://openalex.org/I157638225","display_name":"California State University, Northridge","ror":"https://ror.org/005f5hv41","country_code":"US","type":"education","lineage":["https://openalex.org/I157638225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T\u00f3th, Csaba D.","raw_affiliation_strings":["California State University Northridge, Los Angeles, CA, USA","Tufts University, Medford, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-8769-3190","affiliations":[{"raw_affiliation_string":"California State University Northridge, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I157638225"]},{"raw_affiliation_string":"Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5116592754","display_name":"Tianyi Zhang","orcid":"https://orcid.org/0009-0007-0575-0870"},"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":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7860999703407288,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7860999703407288,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.08810000121593475,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.046799998730421066,"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/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.8034999966621399},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.753000020980835},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6686000227928162},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6632999777793884},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.6197999715805054},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6100999712944031},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5706999897956848},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5188999772071838},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5080000162124634}],"concepts":[{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.8034999966621399},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.800599992275238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7791000008583069},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.753000020980835},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6686000227928162},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6632999777793884},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.6197999715805054},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6100999712944031},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5706999897956848},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5188999772071838},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5080000162124634},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.487199991941452},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4438999891281128},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4366999864578247},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.40310001373291016},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.33219999074935913},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2948000133037567},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.27619999647140503},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.26170000433921814},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.25110000371932983},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.2502000033855438}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2512.10797","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.10797","pdf_url":"https://arxiv.org/pdf/2512.10797","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25878","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.71","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.71/LIPIcs.SoCG.2026.71.pdf","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":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.socg.2026.71","is_oa":true,"landing_page_url":"http://dl.acm.org/citation.cfm?id=314161.314397","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2512.10797","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.10797","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.socg.2026.71","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.71","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.10797","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.10797","pdf_url":"https://arxiv.org/pdf/2512.10797","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3133442982","display_name":"NSF-BSF: Small: AF: Towards a Unified Theory of Spanners","funder_award_id":"2121952","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G36785167","display_name":null,"funder_award_id":"101043159","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5282860457","display_name":null,"funder_award_id":"CCF-2121952","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5538989096","display_name":"A New Paradigm for Flow and Cut Algorithms","funder_award_id":"218022","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G6087696832","display_name":"NSF-BSF: AF: Small: New Frontiers in Distance Sketching","funder_award_id":"2517033","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6254694730","display_name":null,"funder_award_id":"DMS-2154347","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7271835885","display_name":"CAREER: Geometric Techniques for Topological Graph Algorithms","funder_award_id":"2237288","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8961992780","display_name":null,"funder_award_id":"TMSGI2","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320321652","display_name":"Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich","ror":"https://ror.org/05a28rw58"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417296845.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0,139],"a":[1,10,17,23,30,36,51,70,87,106,126,142,153,171,198],"weighted":[2],"graph":[3,121],"$G":[4],"=":[5],"(V,":[6],"E,":[7],"w)$":[8],"and":[9,29,64,74,116,152,180],"designated":[11],"source":[12,27,154],"vertex":[13],"$s":[14,47],"\\in":[15,48],"V$,":[16],"spanning":[18,32,52,89],"tree":[19,25,33,38,53,90,175,202],"that":[20],"simultaneously":[21],"approximates":[22],"shortest-path":[24],"w.r.t.":[26,46],"$s$":[28,63],"minimum":[31,88,195],"is":[34,50,79],"called":[35],"shallow-light":[37],"(SLT).":[39],"Specifically,":[40],"an":[41],"$(\u03b1,":[42],"\u03b2)$-SLT":[43],"of":[44,54,72,86,91,97,104,145,197],"$G$":[45,55],"V$":[49],"with":[56,176,203],"root-stretch":[57,177,204],"$\u03b1$":[58],"(preserving":[59],"all":[60],"distances":[61],"between":[62],"the":[65,84,94,101,194],"other":[66],"vertices":[67],"up":[68],"to":[69,114],"factor":[71],"$\u03b1$)":[73],"lightness":[75],"$\u03b2$":[76,82],"(its":[77],"weight":[78,85,181,196],"at":[80,182],"most":[81,183],"times":[83],"$G$).":[92],"Despite":[93],"large":[95],"body":[96],"work":[98],"on":[99],"SLTs,":[100],"basic":[102],"question":[103,132],"whether":[105],"better":[107],"approximation":[108,137],"algorithm":[109,161],"exists":[110],"was":[111],"left":[112],"untouched":[113],"date,":[115],"this":[117,131],"holds":[118],"in":[119,148,163],"any":[120,140],"family.":[122],"This":[123],"paper":[124],"makes":[125],"first":[127,158],"nontrivial":[128],"step":[129],"towards":[130],"by":[133],"presenting":[134],"two":[135],"bicriteria":[136],"algorithms.":[138],"$\u03b5>0$,":[141],"set":[143],"$P$":[144],"$n$":[146],"points":[147],"constant-dimensional":[149],"Euclidean":[150],"space":[151],"$s\\in":[155],"P$,":[156],"our":[157],"(respectively,":[159],"second)":[160],"returns,":[162],"$O(n":[164],"\\log":[165,189],"n":[166],"\\cdot":[167],"{\\rm":[168],"polylog}(1/\u03b5))$":[169],"time,":[170],"non-Steiner":[172,199],"(resp.,":[173,187,200],"Steiner)":[174,201],"$1+O(\u03b5\\log":[178],"\u03b5^{-1})$":[179,186],"$O(\\mathrm{opt}_\u03b5\\cdot":[184,188],"\\log^2":[185],"\u03b5^{-1})$),":[190],"where":[191],"$\\mathrm{opt}_\u03b5$":[192],"denotes":[193],"$1+\u03b5$.":[205]},"counts_by_year":[],"updated_date":"2026-07-18T07:39:51.176621","created_date":"2025-12-13T00:00:00"}