Under the heading
4 - DISCUSSION OF ALTERNATE NON-GRAPH-BASED ALGORITHMS
Adam said ...
"Warren Smith has proposed an alternate solution, which has been
brought up before on the EM list, of simply dragging a "cutting edge"
across the state to make a division at the proper population ratio,
a
Warren Smith wrote in part:
> The "graph partitioning" problem is NP-complete:
I didn't express myself very well. Yes, the "graph-partitioning problem" is
NP-complete, but my suggestion was that we didn't need the full power of
that result. Instead we could reformulate the problem into a disecti
At 01:04 PM 8/22/2005, Adam Tarr wrote:
I want to clear up a couple things, and further comment on
"algorithmic" or "automated" disctricting solutions.
I don't usually post "I agree" posts, I consider them redundant at best.
But I'm making an exception here. Mr. Tarr has done, I think, a brill
Since I transitioned into talking about PR at the end there, let me
make a few more comments on that.
1) In my opinion, PR methods that require actual ranking of
candidates more or less requires a user-friendly touch-screen
interface that allows the voter to do things like drag an entire party
li
I want to clear up a couple things, and further comment on
"algorithmic" or "automated" disctricting solutions. I have several
major topics here:
1) Choosing subdistrict "atoms" for nodes of planar graph
2) Feasibility of assigning weights to edges of the graph
3) Finding optimal or near-optim
