1. Partitioning a graph into balanced connected classes: Formulations, separation and experiments;Miyazawa;European J. Oper. Res.,2021
2. Approximation and inapproximability results on balanced connected partitions of graphs;Chataigner;Discrete Math. Theor. Comput. Sci.,2007
3. Fully polynomial-time approximation schemes for the max–min connected partition problem on interval graphs;Wu;Discrete Math. Algorithms Appl.,2012
4. Approximation algorithms for the maximally balanced connected graph tripartition problem;Chen;J. Combin. Optim.,2020
5. A shifting algorithm for min–max tree partitioning;Becker;J. ACM,1982