Partitioning
Given a graph, G, with n nodes with sizes (weights) w:
with costs on its edges, partition the nodes of G into k, subsets, k ɬ, no larger than a given maximim size, p, so as to minimize the total cost of the edges cut.
as a weighted connectivity matrix describing the edges of G.
A k-way partition of G is a set of non-empty, pairwise-disjoint subsets of G, v1,…,vk, such that
A partition is said to be admissible if
Problem: Find a minimal-cost permissible partition of G