Name
Abstract | ||
|---|---|---|
The paper studies the electoral district design problem where municipalities of a state have to be grouped into districts of nearly equal population while obeying certain politically motivated requirements. We develop a general framework for electoral district design that is based on the close connection of constrained geometric clustering and diagrams. The approach is computationally efficient and flexible enough to pursue various conflicting juridical demands for the shape of the districts. We demonstrate the practicability of our methodology for electoral districting in Germany. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Data Structures and Algorithms | Simulation,Computer science,Operations research,Electoral district,Constrained clustering |
DocType | Volume | Citations |
Journal | abs/1703.02867 | 1 |
PageRank | References | Authors |
0.36 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Brieden | 1 | 43 | 5.11 |
| Peter Gritzmann | 2 | 412 | 46.93 |
| Fabian Klemm | 3 | 1 | 0.36 |