O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-cut problem, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.444-451, 1988.
DOI : 10.1109/SFCS.1988.21960

H. Saran and V. V. Vazirani, Finding k cuts within twice the optimal, Journal of Computing, vol.24, pp.101-108, 1995.

L. Trevisan, Inapproximability of combinatorial optimization problems. CoRR, cs.CC/0409043, 2004.

P. Turán, An extremal problem in graph theory, pp.436-452, 1941.

R. Watrigant, M. Bougeret, R. Giroudeau, and J. König, Sum-max graph partitioning problem
URL : https://hal.archives-ouvertes.fr/lirmm-00738554