We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning.
- Authors
King, Douglas M.; Jacobson, Sheldon H.; Sewell, Edward C.; Tam Cho, Wendy K.
- Abstract
Political districting is an intractable problem with significant ramifications for political representation. Districts often are required to satisfy some legal constraints, but these typically are not very restrictive, allowing decision makers to influence the composition of these districts without violating relevant laws. For example, while districts must often comprise a single contiguous area, a vast collection of acceptable solutions (i.e., sets of districts) remains. Choosing the best set of districts from this collection can be treated as a (planar) graph partitioning problem. When districts must be contiguous, successfully solving this problem requires an efficient computational method for evaluating contiguity constraints; common methods for assessing contiguity can require significant computation as the problem size grows. This paper introduces the geo-graph, a new graph model that ameliorates the computational burdens associated with enforcing contiguity constraints in planar graph partitioning when each vertex corresponds to a particular region of the plane. Through planar graph duality, the geograph provides a scale-invariant method for enforcing contiguity constraints in local search. Furthermore, geo-graphs allow district holes (which typically are considered undesirable) to be rigorously and efficiently integrated into the partitioning process.
- Subjects
ELECTION districts; STATISTICAL decision making; DECISION making; PARALLEL algorithms; VERTEX operator algebras; PROBLEM solving
- Publication
Operations Research, 2012, Vol 60, Issue 5, p1213
- ISSN
0030-364X
- Publication type
Article
- DOI
10.1287/opre.1120.1083