1. Ahmadi, S., Khuller, S., Saha, B.: Min–Max Correlation Clustering via Multicut, pp. 13–26. Integer Programming and Combinatorial Optimization, IPCO, Atlanta (2019)
2. Angelidakis, H., Makarychev, Y., Manurangsi, P.: An Improved Integrality Gap for the Călinescu–Karloff–Rabani Relaxation for Multiway Cut, pp. 39–50. Integer Programming and Combinatorial Optimization, IPCO, Atlanta (2017)
3. Bansal, N., Feige, U., Krauthgamer, R., Makarychev, K., Nagarajan, V., Naor, J., Schwartz, R.: Min–max graph partitioning and small set expansion. SIAM J. Comput. 43(2), 872–904 (2014)
4. Bérczi, K., Chandrasekaran, K., Király, T., Madan, V.: Improving the integrality gap for multiway cut. Math. Program. 183, 171–193 (2020)
5. Buchbinder, N., Naor, J., Schwartz, R.: Simplex partitioning via exponential clocks and the multiway cut problem. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC, pp. 535–544 (2013)