Balanced Districting on Grid Graphs with Provable Compactness and Contiguity

no code implementations • 9 Feb 2021 • Cyrus Hettle, Shixiang Zhu, Swati Gupta, Yao Xie

Given a graph $G = (V, E)$ with vertex weights $w(v)$ and a desired number of parts $k$, the goal in graph partitioning problems is to partition the vertex set V into parts $V_1,\ldots, V_k$.

graph partitioning Data Structures and Algorithms Combinatorics Optimization and Control