A mini-max spanning forest approach to the political districting problem

Authors:
Takeo Yamada
Affiliations:
Department of Computer Science, The National Defense Academy, Yokosuka, Kanagawa, Japan
Venue:
International Journal of Systems Science
Year:
2009

Citing 6
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Optimal political districting

Computers and Operations Research
An Optimization Based Heuristic for Political Districting

Management Science
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
A reactive GRASP for a commercial territory design problem with multiple balancing requirements

Computers and Operations Research

Designing New Electoral Districts for the City of Edmonton

Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formulate the problem of political districting as a mini-max spanning forest problem, and present some local search-based heuristics to solve the problem approximately. Through numerical experiments, we evaluate the performance of the developed algorithms. We also give a case study of a prefecture in Japan for the election of the Lower House Members of the National Diet. We observe that 'hyperopic' algorithm usually gives satisfactory solutions, with the resulting districts all connected and usually balanced in size.