The Computational Complexity of Automated Redistricting : Is Automation the Answer ?

@inproceedings{v2013TheCC,
  title={The Computational Complexity of Automated Redistricting : Is Automation the Answer ?},
  author={Shaw v.},
  year={2013}
}
  • Shaw v.
  • Published 2013
Ronald Reagan and Justice Brennan have both suggested that computers can remove the controversy and politics from redistricting. ' In fact proponents of automated redistricting claim that the "optimal" districting plan can be determined, given any set of specified values. The Supreme Court has expressed a similar sentiment by addressing such mechanical principles as contiguity and compactness in two recent redistricting cases, Shaw v. Reno4 
13 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

97th Cong., 2d Sess

  • S. REP
  • U.S.C.C.A.N
  • 1982
Highly Influential
7 Excerpts

The Consistency and Effectiveness of Mandatory District Compactness Rules

  • See Micah Altman
  • (Apr
  • 1995
1 Excerpt

The Rights to Vote: Some Pessimism about Formalism, 71

  • See generally Pamela S. Karlan
  • TEX. L. REV
  • 1993
1 Excerpt

Computer Methods of Districting, in REAPPORTIONING LEGISLATURES

  • See Myron Q. Hale
  • (Howard D. Hamilton ed.,
  • 1966

Similar Papers

Loading similar papers…