Linear-size formulations for connected planar graph partitioning and political districting
Motivated by applications in political districting, we consider the task of partitioning the n vertices of a planar graph into k connected components. We propose an extended formulation for this task that has two desirable properties: (i) it uses just O(n) variables, constraints, and nonzeros, and (...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg
2024
|
| Online Access: | https://hdl.handle.net/1721.1/153305 |