{"id":"https://openalex.org/W7154156062","doi":"https://doi.org/10.48550/arxiv.2604.09522","title":"Packing Compact Subgraphs with Applications to Districting","display_name":"Packing Compact Subgraphs with Applications to Districting","publication_year":2026,"publication_date":"2026-04-10","ids":{"openalex":"https://openalex.org/W7154156062","doi":"https://doi.org/10.48550/arxiv.2604.09522"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.09522","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09522","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.09522","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087513049","display_name":"Ho-Lin Chen","orcid":"https://orcid.org/0000-0002-6171-9962"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Ho-Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133545754","display_name":"Po-Yu Chou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chou, Po-Yu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133526178","display_name":"Prathamesh Dharangutte","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dharangutte, Prathamesh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133504927","display_name":"Jie Gao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Jie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086319053","display_name":"Shang-En Huang","orcid":"https://orcid.org/0000-0002-9799-0981"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Shang-En","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043260637","display_name":"Fang-Yi Yu","orcid":"https://orcid.org/0000-0002-3697-8807"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Fang-Yi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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.6685000061988831,"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.6685000061988831,"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.08340000361204147,"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/T12176","display_name":"Optimization and Packing Problems","score":0.07159999758005142,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7002000212669373},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6686000227928162},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5587999820709229},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5547000169754028},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.474700003862381},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.450300008058548},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.3815999925136566},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37929999828338623},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.36559998989105225}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7002000212669373},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6686000227928162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6644999980926514},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6513000130653381},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5587999820709229},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5547000169754028},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4875999987125397},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3815999925136566},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37929999828338623},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.36169999837875366},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.31450000405311584},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.3028999865055084},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.2847999930381775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2784000039100647},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.26109999418258667},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.25920000672340393}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.09522","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09522","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.09522","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09522","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"Packing":[0],"disjoint":[1,60],"subgraphs":[2,22],"in":[3,155],"a":[4,8,31,43,117,152,164,181,189,222],"given":[5],"graph":[6,250],"is":[7],"fundamental":[9],"problem":[10],"with":[11,116],"many":[12],"applications.":[13],"Motivated":[14],"by":[15,59,249],"political":[16,52],"districting,":[17],"we":[18,69,95,142,171,179,220],"focus":[19],"on":[20,80,167,203,240],"connected":[21],"that":[23,36,62,73,173,191,210],"are":[24],"compact":[25],"(e.g.,":[26,51],"having":[27],"constant":[28,153],"radius":[29],"from":[30,100],"single":[32],"center":[33],"vertex)":[34],"and":[35,86,131,157,205,242,251],"satisfy":[37],"additional":[38],"composition":[39,231],"requirements,":[40],"such":[41],"as":[42,229],"minimum":[44,223],"population/weight":[45],"threshold":[46,225],"or":[47],"balanced":[48,81,107],"weight":[49,224],"types":[50],"affiliations).":[53],"We":[54,120,208,236],"aim":[55],"to":[56,103,128,162,197],"maximize":[57],"coverage":[58],"districts":[61,83,109,150,202],"meet":[63],"these":[64,213],"requirements.":[65],"In":[66,93,160],"this":[67,174,247],"work,":[68],"present":[70,237],"new":[71],"results":[72,124,214,239],"substantially":[74],"improve":[75,96],"the":[76,97,111,123,168,185,230],"previously":[77],"known":[78],"bounds":[79],"star":[82,108],"for":[84,105,147,199,226,246],"planar":[85,126,156,204],"minor-free":[87,129],"graphs":[88,127,130,137],"(Dharangutte":[89],"et":[90],"al.":[91],"2025).":[92],"particular,":[94],"approximation":[98,146,166,245],"factor":[99,190],"$O(\\log":[101],"n)$":[102],"$O(1)$":[104,145],"packing":[106,148],"using":[110],"exact":[112],"same":[113],"algorithm,":[114],"but":[115],"refined":[118],"analysis.":[119],"also":[121,216],"extend":[122],"beyond":[125],"an":[132,144],"even":[133],"broader":[134],"family":[135],"of":[136,138,184,212,244],"bounded":[139,200],"expansion.":[140],"Additionally,":[141],"obtain":[143],"radius-$k$":[149,201],"(with":[151],"$k$)":[154],"apex-minor-free":[158,206],"graphs.":[159,207],"order":[161],"get":[163],"$(1+\\varepsilon)$":[165],"max":[169],"coverage,":[170],"show":[172,209],"can":[175,192,215],"be":[176,193,217],"achieved":[177],"if":[178,219],"allow":[180],"slight":[182],"relaxation":[183],"balancedness":[186],"parameters":[187],"(by":[188],"made":[194],"arbitrarily":[195],"close":[196],"$1$),":[198],"all":[211],"obtained":[218],"enforce":[221],"each":[227],"district":[228,252],"requirement,":[232],"rather":[233],"than":[234],"balancedness.":[235],"various":[238],"hardness":[241,243],"variant,":[248],"types.":[253]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-14T00:00:00"}