1. Becker, R.I., Schach, S.R., Perl, Y.: A shifting algorithm for min-max tree partitioning. J. ACM 29, 58–67 (1982)
2. Chataigner, F., Salgado, L.R.B., Wakabayashi, Y.: Approximation and inapproximability results on balanced connected partitions of graphs. Discrete Math. Theor. Comput. Sci. 9, 177–192 (2007)
3. Chen, G., Chen, Y., Chen, Z.-Z., Lin, G., Liu, T., Zhang, A.: Approximation algorithms for maximally balanced connected graph tripartition problem (2019). Submission under review
4. Chen, Y., Chen, Z.-Z., Lin, G., Xu, Y., Zhang, A.: Approximation algorithms for maximally balanced connected graph partition (2019). arXiv:1910.02470
5. Chlebíková, J.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett. 60, 225–230 (1996)