Approximation algorithms for maximally balanced connected graph partition

Yong Chen, Zhi-Zhong Chen, Guohui Lin +2

Given a simple connected graph $G=(V,E)$, we seek to partition the vertex set $V$ into $k$ non-empty parts such that the subgraph induced by each part is connected, and the part…