[prev in list] [next in list] [prev in thread] [next in thread] 

List:       boost
Subject:    Re: [boost] BGL question about districting
From:       Barend Gehrels <barend () geodan ! nl>
Date:       2009-02-27 18:59:14
Message-ID: 49A83802.5010000 () geodan ! nl
[Download RAW message or body]


> 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.
Regards, Barend


_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
[prev in list] [next in list] [prev in thread] [next in thread]