Optimal Redistricting Under Geographical Constraints: Why 'Pack and Crack' Does Not Work
暂无分享,去创建一个
[1] John F. Canny,et al. A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] Bernard Grofman,et al. Optimal partisan gerrymandering , 1988 .
[3] Richard Holden,et al. Optimal Gerrymandering: Sometimes Pack, but Never Crack , 2008 .
[4] Katerina Sherstyuk,et al. How to gerrymander: A formal analysis , 1998 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Micah Altman,et al. Is automation the answer: the computational complexity of automated redistricting , 1997 .
[7] Thomas W. Gilligan,et al. Structural constraints on partisan bias under the efficient gerrymander , 1999 .
[8] Clemens Puppe,et al. A Computational Approach to Unbiased Districting , 2008, Math. Comput. Model..
[9] Faruk Gul,et al. Strategic Redistricting† , 2007 .
[10] Michael P. McDonald,et al. From Crayons to Computers , 2005 .