{"id":"https://openalex.org/W4417119456","doi":"https://doi.org/10.1145/3798129.3800861","title":"Planar Length-Constrained Minimum Spanning Trees","display_name":"Planar Length-Constrained Minimum Spanning Trees","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4417119456","doi":"https://doi.org/10.1145/3798129.3800861"},"language":"en","primary_location":{"id":"doi:10.1145/3798129.3800861","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800861","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800861","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021573603","display_name":"D Ellis Hershkowitz","orcid":"https://orcid.org/0000-0003-0862-3715"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D Ellis Hershkowitz","raw_affiliation_strings":["Brown University, Providence, USA"],"raw_orcid":"https://orcid.org/0000-0003-0862-3715","affiliations":[{"raw_affiliation_string":"Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102109701","display_name":"Richard Z Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Z Huang","raw_affiliation_strings":["Brown University, Providence, USA"],"raw_orcid":"https://orcid.org/0009-0002-5611-9863","affiliations":[{"raw_affiliation_string":"Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"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":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03159588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1528","last_page":"1539"},"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.6754000186920166,"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.6754000186920166,"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.20489999651908875,"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.06800000369548798,"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/spanning-tree","display_name":"Spanning tree","score":0.763700008392334},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7476000189781189},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6524999737739563},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.5303999781608582},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5001999735832214},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.49549999833106995},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47940000891685486},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.46869999170303345},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4632999897003174},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.46160000562667847}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.763700008392334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7580000162124634},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7476000189781189},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7437000274658203},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6524999737739563},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.5303999781608582},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5001999735832214},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.49549999833106995},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47940000891685486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47119998931884766},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4632999897003174},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.46160000562667847},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.459199994802475},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4334000051021576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42080000042915344},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.40869998931884766},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4027999937534332},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.40130001306533813},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.3792000114917755},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.3409000039100647},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2985000014305115},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.2793000042438507},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.25540000200271606},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.2551000118255615},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2515000104904175},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3798129.3800861","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800861","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2510.09002","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.09002","pdf_url":"https://arxiv.org/pdf/2510.09002","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:doi:10.48550/arxiv.2510.09002","is_oa":true,"landing_page_url":null,"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":"Article"},{"id":"doi:10.48550/arxiv.2510.09002","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.09002","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800861","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800861","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"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":{"In":[0],"length-constrained":[1,116,133,147,183],"minimum":[2,56],"spanning":[3,53],"tree":[4,54],"(MST)":[5],"we":[6,138],"are":[7,152],"given":[8],"an":[9,91,160],"$n$-node":[10],"graph":[11],"$G":[12],"=":[13],"(V,E)$":[14],"with":[15,33,95],"edge":[16,25],"weights":[17],"$w":[18],":":[19],"E":[20,28],"\\to":[21,29],"\\mathbb{Z}_{\\geq":[22,30,45],"0}$":[23,31],"and":[24,40,187],"lengths":[26],"$l:":[27],"along":[32],"a":[34,41,52,78],"root":[35],"node":[36,64,97],"$r":[37],"\\in":[38,44],"V$":[39],"length-constraint":[42],"$h":[43],"0}$.":[46],"Our":[47,110],"goal":[48],"is":[49,65,112],"to":[50,59,74],"output":[51],"of":[55,118,125,162,182],"weight":[57],"according":[58,73],"$w$":[60],"in":[61,149,185],"which":[62,122,150],"every":[63,96],"at":[66,68,98,100,153],"distance":[67,99],"most":[69,101,154],"$h$":[70],"from":[71,103,156],"$r$":[72,104,157],"$l$.":[75],"We":[76],"give":[77],"polynomial-time":[79],"algorithm":[80,111,130,142],"for":[81,85,105,132,146,166],"planar":[82,120,186],"graphs":[83,145],"which,":[84],"any":[86,106,141,167],"constant":[87,107,168],"$\u03b5>":[88,108,169],"0$,":[89],"outputs":[90],"$O\\left(\\log^{1+\u03b5}":[92],"n\\right)$-approximate":[93],"solution":[94],"$(1+\u03b5)h$":[102],"0$.":[109],"based":[113],"on":[114,143],"new":[115],"versions":[117],"classic":[119],"separators":[121],"may":[123],"be":[124],"independent":[126],"interest.":[127],"Additionally,":[128],"our":[129,177],"works":[131],"Steiner":[134],"tree.":[135],"Complementing":[136],"this,":[137],"show":[139],"that":[140],"general":[144,188],"MST":[148,184],"nodes":[151],"$2h$":[155],"cannot":[158],"achieve":[159],"approximation":[161],"$O\\left(\\log":[163],"^{2-\u03b5}":[164],"n\\right)$":[165],"0$":[170],"under":[171],"standard":[172],"complexity":[173],"assumptions;":[174],"as":[175],"such,":[176],"results":[178],"separate":[179],"the":[180],"approximability":[181],"graphs.":[189]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-14T00:00:00"}