Weighted Voronoi region algorithms for political districting

DOI10.1016/j.mcm.2008.05.041zbMath1187.91187OpenAlexW2124993079MaRDI QIDQ2389781

Andrea Scozzari, Federica Ricca, Bruno Simeone

Publication date: 18 July 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1302/

zbMATH Keywords

heuristicsgraph partitioningpolitical districtingweighted Voronoi regions

Mathematics Subject Classification ID

Voting theory (91B12) History, political science (91F10)

Related Items

An overview of graph covering and partitioning, Optimal partisan districting on planar geographies, Voronoi diagrams with overlapping regions, Political districting: from classical models to recent approaches, Imposing Contiguity Constraints in Political Districting Models, A new integer linear programming formulation for the problem of political districting, Districting for Arc Routing, Goal programming approach for political districting in Santa Catarina state: Brazil, Constraint-based electoral districting using a new compactness measure: an application to Portugal, Reconfiguration of connected graph partitions, Constrained clustering via diagrams: a unified theory and its application to electoral district design, Political districting: From classical models to recent approaches, Mathematical political districting taking care of minority groups, The geo-graph in practice: creating United States congressional districts from census blocks, Political districting to minimize cut edges

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• A tabu search heuristic and adaptive memory procedure for political districting
• Local search algorithms for political districting
• An Optimization Based Heuristic for Political Districting
• Evaluation and Optimization of Electoral Systems
• Fair dissections of spiders, worms, and caterpillars