{"id":"https://openalex.org/W7162999834","doi":"https://doi.org/10.4230/lipics.forc.2026.10","title":"Packing Compact Subgraphs with Applications to Districting","display_name":"Packing Compact Subgraphs with Applications to Districting","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162999834","doi":"https://doi.org/10.4230/lipics.forc.2026.10"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25982","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2026.10","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol368-forc2026/LIPIcs.FORC.2026.10/LIPIcs.FORC.2026.10.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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol368-forc2026/LIPIcs.FORC.2026.10/LIPIcs.FORC.2026.10.pdf","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":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chen, Ho-Lin","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan"],"raw_orcid":"https://orcid.org/0000-0002-6171-9962","affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133545754","display_name":"Po-Yu Chou","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chou, Po-Yu","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan"],"raw_orcid":"https://orcid.org/0009-0002-7813-7616","affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023524103","display_name":"Prathamesh Dharangutte","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dharangutte, Prathamesh","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"raw_orcid":"https://orcid.org/0009-0009-7718-5932","affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137580797","display_name":"Jie Gao","orcid":"https://orcid.org/0000-0001-5083-6082"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gao, Jie","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0001-5083-6082","affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086319053","display_name":"Shang-En Huang","orcid":"https://orcid.org/0000-0002-9799-0981"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Huang, Shang-En","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan"],"raw_orcid":"https://orcid.org/0000-0002-9799-0981","affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043260637","display_name":"Fang-Yi Yu","orcid":"https://orcid.org/0000-0002-3697-8807"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yu, Fang-Yi","raw_affiliation_strings":["George Mason University, Fairfax, VA, USA"],"raw_orcid":"https://orcid.org/0000-0002-3697-8807","affiliations":[{"raw_affiliation_string":"George Mason University, Fairfax, VA, USA","institution_ids":["https://openalex.org/I162714631"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"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.89541177,"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_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7630000114440918,"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.7630000114440918,"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.09319999814033508,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.04320000112056732,"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":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25982","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2026.10","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol368-forc2026/LIPIcs.FORC.2026.10/LIPIcs.FORC.2026.10.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":"publishedVersion"},{"id":"doi:10.4230/lipics.forc.2026.10","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.forc.2026.10","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25982","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2026.10","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol368-forc2026/LIPIcs.FORC.2026.10/LIPIcs.FORC.2026.10.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":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162999834.pdf","grobid_xml":"https://content.openalex.org/works/W7162999834.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Packing":[0],"disjoint":[1,60],"subgraphs":[2,22],"in":[3,156],"a":[4,8,31,43,118,153,165,182,190,223],"given":[5],"graph":[6,251],"is":[7],"fundamental":[9],"problem":[10],"with":[11,117],"many":[12],"applications.":[13],"Motivated":[14],"by":[15,59,250],"political":[16,52],"districting,":[17],"we":[18,69,96,143,172,180,221],"focus":[19],"on":[20,80,168,204,241],"connected":[21],"that":[23,36,62,73,174,192,211],"are":[24],"compact":[25],"(e.g.,":[26,51],"having":[27],"constant":[28,154],"radius":[29],"from":[30,101],"single":[32],"center":[33],"vertex)":[34],"and":[35,86,132,158,206,243,252],"satisfy":[37],"additional":[38],"composition":[39,232],"requirements,":[40],"such":[41],"as":[42,230],"minimum":[44,224],"population/weight":[45],"threshold":[46,226],"or":[47],"balanced":[48,81,108],"weight":[49,225],"types":[50],"affiliations).":[53],"We":[54,121,209,237],"aim":[55],"to":[56,104,129,163,198],"maximize":[57],"coverage":[58],"districts":[61,83,110,151,203],"meet":[63],"these":[64,214],"requirements.":[65],"In":[66,94,161],"this":[67,175,248],"work,":[68],"present":[70,238],"new":[71],"results":[72,125,215,240],"substantially":[74],"improve":[75,97],"the":[76,98,112,124,169,186,231],"previously":[77],"known":[78],"bounds":[79],"star":[82,109],"for":[84,106,148,200,227,247],"planar":[85,127,157,205],"minor-free":[87,130],"graphs":[88,128,131,138],"[Prathamesh":[89],"Dharangutte":[90],"et":[91],"al.,":[92],"2025].":[93],"particular,":[95],"approximation":[99,147,167,246],"factor":[100,191],"O(log":[102],"n)":[103],"O(1)":[105,146],"packing":[107,149],"using":[111],"exact":[113],"same":[114],"algorithm,":[115],"but":[116],"refined":[119],"analysis.":[120],"also":[122,217],"extend":[123],"beyond":[126],"an":[133,145],"even":[134],"broader":[135],"family":[136],"of":[137,139,185,213,245],"bounded":[140,201],"expansion.":[141],"Additionally,":[142],"obtain":[144],"radius-k":[150,202],"(with":[152],"k)":[155],"apex-minor-free":[159,207],"graphs.":[160,208],"order":[162],"get":[164],"(1+\u03b5)":[166],"max":[170],"coverage,":[171],"show":[173,210],"can":[176,193,216],"be":[177,194,218],"achieved":[178],"if":[179,220],"allow":[181],"slight":[183],"relaxation":[184],"balancedness":[187],"parameters":[188],"(by":[189],"made":[195],"arbitrarily":[196],"close":[197],"1),":[199],"all":[212],"obtained":[219],"enforce":[222],"each":[228],"district":[229,253],"requirement,":[233],"rather":[234],"than":[235],"balancedness.":[236],"various":[239],"hardness":[242,244],"variant,":[249],"types.":[254]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-02T00:00:00"}