{"id":"https://openalex.org/W4416146767","doi":"https://doi.org/10.4230/lipics.socg.2026.70","title":"Tree-Like Shortcuttings of Trees","display_name":"Tree-Like Shortcuttings of Trees","publication_year":2025,"publication_date":"2025-10-16","ids":{"openalex":"https://openalex.org/W4416146767","doi":"https://doi.org/10.4230/lipics.socg.2026.70"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2510.14918","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.14918","pdf_url":"https://arxiv.org/pdf/2510.14918","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/2510.14918","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015248117","display_name":"Hung Le","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":"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/A5054075729","display_name":"Lazar Milenkovi\u0107","orcid":"https://orcid.org/0000-0003-2657-8241"},"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"]},{"id":"https://openalex.org/I58918642","display_name":"Sofia University \"St. Kliment Ohridski\"","ror":"https://ror.org/02jv3k292","country_code":"BG","type":"education","lineage":["https://openalex.org/I58918642"]}],"countries":["BG","IL"],"is_corresponding":false,"raw_author_name":"Milenkovi\u0107, Lazar","raw_affiliation_strings":["Tel Aviv University, Israel","INSAIT, Sofia University \"St. Kliment Ohridski\", Bulgaria"],"raw_orcid":"https://orcid.org/0000-0001-5777-2229","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"INSAIT, Sofia University \"St. Kliment Ohridski\", Bulgaria","institution_ids":["https://openalex.org/I58918642"]}]},{"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":"last","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"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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.9448000192642212,"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.9448000192642212,"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.029400000348687172,"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.003700000001117587,"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/treewidth","display_name":"Treewidth","score":0.6065000295639038},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5778999924659729},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5389999747276306},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5091000199317932},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47510001063346863},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46209999918937683},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.45010000467300415},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.39579999446868896}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.679099977016449},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6065000295639038},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5778999924659729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5673999786376953},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5389999747276306},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5091000199317932},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47510001063346863},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46209999918937683},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.45010000467300415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4424999952316284},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.39579999446868896},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.3937000036239624},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.37209999561309814},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.3555000126361847},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.3158999979496002},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3077999949455261},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.29679998755455017},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.27959999442100525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2703999876976013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2599000036716461}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2510.14918","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.14918","pdf_url":"https://arxiv.org/pdf/2510.14918","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:25877","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.70","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.70/LIPIcs.SoCG.2026.70.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.70","is_oa":true,"landing_page_url":"https://minorfree.github.io/tree-shortcutting/","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.2510.14918","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.14918","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.70","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.70","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:2510.14918","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.14918","pdf_url":"https://arxiv.org/pdf/2510.14918","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416146767.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Sparse":[0],"shortcuttings":[1,114,118,133,157,193],"of":[2,28,82,154,194,221,235,241,253,266,318,329],"trees":[3,70,121],"-":[4,14,185,251],"equivalently,":[5],"sparse":[6],"1-spanners":[7],"for":[8,112,119,146,191,204,218,232],"tree":[9,55,113,156],"metrics":[10],"with":[11,122,278,286,311],"bounded":[12],"hop-diameter":[13,106,201,206,280,293],"have":[15],"been":[16],"studied":[17],"extensively":[18],"(under":[19],"different":[20],"names":[21],"and":[22,37,57,91,107,115,179,188,202,244,260,281,314],"settings),":[23],"since":[24],"the":[25,308],"pioneering":[26],"works":[27,81],"[Andrew":[29,83],"Chi-Chih":[30,84],"Yao,":[31,85],"1982;":[32,86],"Chazelle,":[33,87],"1987;":[34,40,88,94],"Noga":[35,89],"Alon":[36,90],"Baruch":[38,92],"Schieber,":[39,93],"Hans":[41,95],"L.":[42,96],"Bodlaender":[43,97],"et":[44,98,268,272,332],"al.,":[45,99,273,333],"1994],":[46],"initially":[47],"motivated":[48],"by":[49],"applications":[50],"to":[51,60,71,208,296],"range":[52],"queries,":[53],"online":[54],"product,":[56],"MST":[58],"verification,":[59],"name":[61],"a":[62,102,143,151,172,176,215,276,303,315],"few.":[63],"These":[64],"constructions":[65],"were":[66],"also":[67,213],"lifted":[68],"from":[69,175],"other":[72],"graph":[73,166,173],"families":[74],"using":[75],"known":[76,131],"low-distortion":[77],"embedding":[78],"results.":[79],"The":[80],"1994]":[100],"establish":[101],"tight":[103],"tradeoff":[104,199],"between":[105,200],"sparsity":[108,123,138,282],"(or":[109],"average":[110],"degree)":[111],"imply":[116],"constant-hop":[117,132,155],"n-node":[120],"O(log^*":[124,283],"n).":[125,211],"Despite":[126],"their":[127],"small":[128],"sparsity,":[129],"all":[130,205,233],"contain":[134],"dense":[135],"subgraphs":[136],"(of":[137],"\u03a9(log":[139],"n)),":[140],"which":[141,223],"is":[142,174,183,294],"significant":[144],"drawback":[145],"many":[147],"applications.":[148],"We":[149,161,212,289],"initiate":[150],"systematic":[152],"study":[153],"that":[158,168,291],"are":[159],"\"tree-like\".":[160],"focus":[162],"on":[163,257],"two":[164],"well-studied":[165],"parameters":[167],"measure":[169],"how":[170],"far":[171],"tree:":[177],"arboricity":[178,298],"treewidth.":[180],"Our":[181],"contribution":[182],"twofold.":[184],"New":[186],"upper":[187],"lower":[189,216],"bounds":[190],"tree-like":[192],"trees,":[195],"including":[196],"an":[197,238,326],"optimal":[198],"treewidth":[203,227],"up":[207],"O(log":[209],"log":[210,230,321,322],"provide":[214],"bound":[217],"larger":[219],"values":[220,234],"k,":[222],"together":[224],"yield":[225],"hop-diameter\u00d7":[226],"=":[228],"\u03a9((log":[229],"n)\u00b2)":[231],"hop-diameter,":[236],"resolving":[237,325],"open":[239,327],"question":[240,328],"[Arnold":[242],"Filtser":[243],"Hung":[245],"Le,":[246,249],"2022;":[247],"H.":[248],"2023].":[250],"Applications":[252],"these":[254],"bounds,":[255],"focusing":[256],"low-dimensional":[258],"Euclidean":[259],"doubling":[261],"metrics.":[262],"A":[263],"seminal":[264],"work":[265],"Arya":[267,271],"al.":[269],"[S.":[270],"1995]":[274],"presented":[275],"(1+\u03b5)-spanner":[277],"constant":[279,292],"n),":[284],"but":[285],"large":[287],"arboricity.":[288],"show":[290],"sufficient":[295],"achieve":[297],"O(log^*{n}).":[299],"Furthermore,":[300],"we":[301],"present":[302],"(1+\u03b5)-stretch":[304],"routing":[305],"scheme":[306],"in":[307],"fixed-port":[309],"model":[310],"3":[312],"hops":[313],"local":[316],"memory":[317],"O(log\u00b2n":[319],"/":[320],"n)":[323],"bits,":[324],"[Omri":[330],"Kahalon":[331],"2022].":[334]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-18T00:00:00"}