M. Charikar, N. Gupta, and R. Schwartz. Local guarantees in graph cuts and clustering. In Integer Programming and Combinatorial Optimization: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings, pages 136-147. Springer, 2017.
S. Chawla, K. Makarychev, T. Schramm, and G. Yaroslavtsev. Near optimal lp rounding algorithm for correlationclustering on complete and complete k-partite graphs. In Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pages 219-228, 2015.
F. Chierichetti, N. Dalvi, and R. Kumar. Correlation clustering in mapreduce. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 641-650, 2014.
F. Chierichetti, R. Kumar, S. Lattanzi, and S. Vassilvitskii. Fair clustering through fairlets. Advances in neural information processing systems, 30, 2017.
V. Cohen-Addad, S. Lattanzi, S. Mitrovic, A. Norouzi-Fard, N. Parotsidis, and J. Tarnawski. Correlation clustering in constant many parallel rounds. In International Conference on Machine Learning, pages 2069-2078. PMLR, 2021.
V. Cohen-Addad, S. Lattanzi, A. Maggiori, and N. Parotsidis. Online and consistent correlation clustering. In International Conference on Machine Learning, pages 4157-4179. PMLR, 2022a.
V. Cohen-Addad, E. Lee, and A. Newman. Correlation clustering with sherali-adams. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 651-661. IEEE, 2022b.
V. Cohen-Addad, E. Lee, S. Li, and A. Newman. Handling correlated rounding error via preclustering: A 1.73-approximation for correlation clustering. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2023.
S. Davies, B. Moseley, and H. Newman. Fast combinatorial algorithms for min max correlation clustering. In 40th International Conference on Machine Learning (ICML'23), 2023.
E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica. Correlation clustering in general weighted graphs. Theoretical Computer Science, 361(2-3):172-187, 2006.
M. Elsner and W. Schudy. Bounding and comparing methods for correlation clustering beyond ilp. In Proceedings of the Workshop on Integer Linear Programming for Natural Language Processing, pages 19-27, 2009.
J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. On graph problems in a semistrreaming model. Theoretical Computer Science, 348(2-3):207-216, 2005.
M. Fischer and A. Noever. Tight analysis of parallel randomized greedy mis. ACM Transactions on Algorithms (TALG), 16(1):1-13, 2019.
Z. Friggstad and R. Mousavi. Fair correlation clustering with global and local guarantees. In Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings 17, pages 414–427. Springer, 2021.
M. Ghaffari, T. Gouleakis, C. Konrad, S. Mitrovic, and R. Rubinfeld. Improved massively parallel computation algorithms for mis, matching, and vertex cover. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pages 129-138, 2018.
J. Jafarov, S. Kalhan, K. Makarychev, and Y. Makarychev. Correlation clustering with asymmetric classification errors. In International Conference on Machine Learning, pages 4641-4650. PMLR, 2020.
J. Jafarov, S. Kalhan, K. Makarychev, and Y. Makarychev. Local correlation clustering with asymmetric classification errors. In International Conference on Machine Learning, pages 4677-4686. PMLR, 2021.
S. Kalhan, K. Makarychev, and T. Zhou. Correlation clustering with local objectives. Advances in Neural Information Processing Systems, 32, 2019.