{"id":"https://openalex.org/W7204192245","doi":"https://doi.org/10.4230/lipics.esa.2026.145","title":"Hierarchical Spanners","display_name":"Hierarchical Spanners","alternate_titles":[],"publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7204192245","doi":"https://doi.org/10.4230/lipics.esa.2026.145"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:27281","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.145","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol388-esa2026/LIPIcs.ESA.2026.145/LIPIcs.ESA.2026.145.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,"listed_in":[],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W7204170730","display_name":"LIPIcs, Volume 388, ESA 2026, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W7204192245","https://openalex.org/W7204170730"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol388-esa2026/LIPIcs.ESA.2026.145/LIPIcs.ESA.2026.145.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042522865","display_name":"Davide Bil\u00f2","orcid":"https://orcid.org/0000-0003-3169-4300","observed_orcids":["https://orcid.org/0000-0003-3169-4300"]},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Bil\u00f2, Davide","raw_affiliation_strings":["Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, Italy"],"raw_orcid":"https://orcid.org/0000-0003-3169-4300","affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027447341","display_name":"Luciano Gual\u00e0","orcid":"https://orcid.org/0000-0001-6976-5579","observed_orcids":["https://orcid.org/0000-0001-6976-5579"]},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gual\u00e0, Luciano","raw_affiliation_strings":["Department of Enterprise Engineering, \"Tor Vergata\" University of Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0001-6976-5579","affiliations":[{"raw_affiliation_string":"Department of Enterprise Engineering, \"Tor Vergata\" University of Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028702811","display_name":"Stefano Leucci","orcid":"https://orcid.org/0000-0002-8848-7006","observed_orcids":["https://orcid.org/0000-0002-8848-7006"]},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Leucci, Stefano","raw_affiliation_strings":["Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8848-7006","affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087770784","display_name":"Guido Proietti","orcid":"https://orcid.org/0000-0003-1009-5552","observed_orcids":["https://orcid.org/0000-0003-1009-5552"]},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Proietti, Guido","raw_affiliation_strings":["Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, Italy"],"raw_orcid":"https://orcid.org/0000-0003-1009-5552","affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Computer Science and Mathematics, University of L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100018961","display_name":"Alessandro Straziota","orcid":"https://orcid.org/0009-0008-4543-786X","observed_orcids":["https://orcid.org/0009-0008-4543-786X"]},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Straziota, Alessandro","raw_affiliation_strings":["Department of Enterprise Engineering, \"Tor Vergata\" University of Rome, Italy"],"raw_orcid":"https://orcid.org/0009-0008-4543-786X","affiliations":[{"raw_affiliation_string":"Department of Enterprise Engineering, \"Tor Vergata\" University of Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"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_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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.9980000257492065,"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.0003000000142492354,"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.0003000000142492354,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hierarchical-graphs","display_name":"hierarchical graphs","score":0.9300000071525574},{"id":"https://openalex.org/keywords/graph-spanners","display_name":"graph spanners","score":0.7760000228881836},{"id":"https://openalex.org/keywords/distance-preservation","display_name":"distance preservation","score":0.6520000100135803},{"id":"https://openalex.org/keywords/additive-spanners","display_name":"additive spanners","score":0.8379999995231628},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7900000214576721}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7390000224113464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6669999957084656},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6442999839782715},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6212999820709229},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.598800003528595},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.593999981880188},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5710999965667725},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.5045999884605408},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43459999561309814},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4146000146865845},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.41100001335144043},{"id":"https://openalex.org/C144986985","wikidata":"https://www.wikidata.org/wiki/Q871236","display_name":"Hierarchical database model","level":2,"score":0.38019999861717224},{"id":"https://openalex.org/C124527596","wikidata":"https://www.wikidata.org/wiki/Q17029359","display_name":"Hierarchical control system","level":3,"score":0.3749000132083893},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3723999857902527},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3068000078201294},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C82261393","wikidata":"https://www.wikidata.org/wiki/Q17038699","display_name":"Hierarchical clustering of networks","level":5,"score":0.28130000829696655},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:27281","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.145","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol388-esa2026/LIPIcs.ESA.2026.145/LIPIcs.ESA.2026.145.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,"listed_in":[],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.esa.2026.145","doi":"https://doi.org/10.4230/lipics.esa.2026.145","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2026.145","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:27281","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.145","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol388-esa2026/LIPIcs.ESA.2026.145/LIPIcs.ESA.2026.145.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,"listed_in":[],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323718","display_name":"Universit\u00e0 degli Studi dell'Aquila","ror":"https://ror.org/01j9p1r26"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204192245.pdf","grobid_xml":"https://content.openalex.org/works/W7204192245.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W181128013","https://openalex.org/W1988067232","https://openalex.org/W1999534475","https://openalex.org/W2002041206","https://openalex.org/W2031536548","https://openalex.org/W2033447978","https://openalex.org/W2607207030","https://openalex.org/W2893179710","https://openalex.org/W2972182693","https://openalex.org/W3208757949","https://openalex.org/W4283379466","https://openalex.org/W4313227581","https://openalex.org/W4376651360","https://openalex.org/W4385270533","https://openalex.org/W4389295062","https://openalex.org/W4390575956","https://openalex.org/W4400340532","https://openalex.org/W6891669102","https://openalex.org/W7110172856"],"related_works":["https://openalex.org/W4407354281","https://openalex.org/W4376651360","https://openalex.org/W7215088277","https://openalex.org/W2902989566","https://openalex.org/W3199626036","https://openalex.org/W4394656222","https://openalex.org/W2952032592","https://openalex.org/W1738494763","https://openalex.org/W7095880735"],"abstract_inverted_index":{"A":[0],"hierarchical":[1,49,115,166,183,218,231,240,247,266],"graph":[2,34],"\ud835\udca2":[3,54],"consists":[4],"of":[5,27,48,53,63,65,72,120,124,126,144,150,233,242,249,259,268],"a":[6,21,25,60,141,202,215,228,264],"vertex":[7],"set":[8,62],"V(\ud835\udca2)":[9,68],"and":[10,80,111,122,263],"L":[11,28],"pairwise":[12],"disjoint":[13],"edge":[14],"sets":[15],"E_1,":[16],"\u2026":[17],",":[18],"E_L.":[19],"Such":[20],"structure":[22],"naturally":[23],"defines":[24],"hierarchy":[26],"unweighted":[29],"graphs,":[30],"where":[31,272],"the":[32,46,73,96,138,145,154,158,165,192],"\ud835\udcc1-th":[33],"is":[35,92,197],"G_\ud835\udcc1":[36],"=":[37],"(V,":[38],"\u22c3_{i=1}^\ud835\udcc1":[39],"E_i).":[40],"In":[41],"this":[42,88,105],"paper,":[43],"we":[44,177,200,221],"initiate":[45],"study":[47],"spanners,":[50,79],"namely":[51],"subgraphs":[52],"that":[55,179],"approximately":[56],"preserve":[57],"distances":[58,132],"among":[59,226],"given":[61],"pairs":[64,123],"vertices":[66,125],"in":[67,191,212],"at":[69],"every":[70,207],"level":[71],"hierarchy.":[74],"This":[75,195],"notion":[76],"generalizes":[77],"classical":[78,155],"thus":[81],"all":[82],"known":[83],"lower":[84,112],"bounds":[85,113,160],"extend":[86,163],"to":[87,134,164],"setting;":[89],"however,":[90],"it":[91],"not":[93,162],"clear":[94],"whether":[95],"same":[97],"size-stretch":[98],"trade-offs":[99],"can":[100],"be":[101,135],"achieved.":[102],"We":[103],"investigate":[104],"question":[106],"by":[107],"devising":[108],"both":[109],"upper":[110,204],"for":[114,206,255],"spanners":[116,172],"under":[117],"various":[118],"types":[119],"stretch":[121,253],"interest":[127],"whose":[128],"approximate":[129],"(or":[130],"exact)":[131],"are":[133,173],"maintained.":[136],"On":[137],"positive":[139,224],"side,":[140],"trivial":[142],"adaptation":[143],"greedy":[146],"construction":[147],"yields":[148],"(2k-1)-spanners":[149],"size":[151,187,234,243,250,269],"O(n^{1+1/k}),":[152],"matching":[153,203],"bounds.":[156],"However,":[157],"non-hierarchical":[159],"do":[161],"case":[167],"when":[168],"additive":[169],"or":[170],"nearly-additive":[171],"considered.":[174],"For":[175],"instance,":[176],"prove":[178],"any":[180,256],"\u03b2-additive":[181],"single-pair":[182,217],"spanner":[184,232,248],"must":[185],"have":[186],"\u03a9":[188],"(n":[189],"\u221a{n/(\u03b2+1)})":[190],"worst":[193],"case.":[194],"bound":[196,205],"tight,":[198],"as":[199],"provide":[201],"\u03b2":[208],"\u2265":[209],"0,":[210,262],"which":[211,227],"turn":[213],"implies":[214],"O(n\u221an)-size":[216],"preserver.":[219],"Finally,":[220],"present":[222],"additional":[223],"results":[225],"4-additive":[229],"all-pairs":[230,246],"O\u0303(n^{5/3}),":[235],"an":[236,245],"(essentially":[237],"tight)":[238],"single-source":[239],"(1+\u03b5)-spanner":[241],"O\u0303(n/\u03b5),":[244],"O\u0303(n\u221a{n/(\u03b5)})":[251],"achieving":[252],"(1+\u03b5,2),":[254],"constant":[257],"value":[258],"\u03b5":[260],">":[261],"subsetwise":[265],"preserver":[267],"O(n":[270],"\u221a{n|S|}),":[271],"S":[273],"\u2286":[274],"V(\ud835\udca2).":[275]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7204192245","counts_by_year":[],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2026-08-26T00:00:00"}
