Subject: Re: [boost] BGL question about districting
From: Barend Gehrels (barend_at_[hidden])
Date: 2009-02-27 13:59:14
> You could probably look at it as a special case of graph partitioning where
> you're weighting vertices and have the constraint that all vertices have
> roughly the same weight. This is somewhat related to flow algorithms (a
> partition is a cut).
> Another view would be to generate a hypergraph (which the BGL doesn't
> natively support) such that each hyperedge is a set of combined districts.
> You could write some algorithm that selected a set of disjoint hyperedges
> all of similar weight.
Thanks! Yes, this helps, these are exactly the right terms. I'll look
further and let you know what I find or create. May take a while.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk