1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2026
Packing Compact Subgraphs with Applications to Districting
Ho-Lin Chen, Po-Yu Chou, Prathamesh Dharangutte +3
Packing disjoint subgraphs in a given graph is a fundamental problem with many applications. Motivated by political districting, we focus on connected subgraphs that are compact (e…
cs.DS2025★ 1 cited
Hardness and Approximation Algorithms for Balanced Districting Problems
Prathamesh Dharangutte, Jie Gao, Shang-En Huang +1
We introduce and study the problem of balanced districting, where given an undirected graph with vertices carrying two types of weights (different population, resource types, etc)…