A N E XTREME -S CALE C OMPUTATIONAL A PPROACH TO R EDISTRICTING O PTIMIZATION Wendy K. Tam Cho∗ Shaowen Wang† Yan Liu‡ University of Illinois at Urbana-Champaign

First Page		Document Content
Date: 2013-09-13 22:32:46 Politics Computing Academia Constituencies Electoral geography Voter suppression Voting systems Operations research Genetic algorithm Redistricting Gerrymandering Algorithm		A N E XTREME -S CALE C OMPUTATIONAL A PPROACH TO R EDISTRICTING O PTIMIZATION Wendy K. Tam Cho∗ Shaowen Wang† Yan Liu‡ University of Illinois at Urbana-Champaign Add to Reading List Source URL: cybergis.cigi.uiuc.edu Download Document from Source Website File Size: 98,85 KB Share Document on Facebook

	Primer for reporters on redistricting & prison-based gerrymandering Who should use this primer: Reporters covering county or municipal redistricting in jurisdictions that contain prisons. What’s at stake: Counties and DocID: 1uPAj - View Document
	How the Efficiency Gap Works Eric Petry The efficiency gap is a standard for measuring partisan gerrymandering that is currently at the heart of the Wisconsin gerrymandering case, Whitford v. Nichol.1 Developed by Nichol DocID: 1uvph - View Document
	Illinois Redistricting Collaborative Talking Points – Feb. Update Goals:  Raise public awareness of gerrymandering as a key electionyear issue DocID: 1uftg - View Document
	Gerrymandering and Convexity Jonathan K. Hodge, Emily Marshall, and Geoff Patterson doi:074683410X510317 Jonathan Hodge () is an Associate Professor of Mathematics at Grand Valley State University DocID: 1t4w3 - View Document
	U.S. Census Bureau Attn: Karen Humes Re: Prison-Based Gerrymandering July 15, 2015 Dear Karen Humes, DocID: 1s4PG - View Document