Co-occurring keywords · papers mentioning both
Papers
Generalizing Fair Clustering to Multiple Groups: Algorithms and Applications
AAAI 2026
A Multi-Task Learning Approach to Linear Multivariate Forecasting
AISTATS 2025
A Sub-Problem Quantum Alternating Operator Ansatz for Correlation Clustering
ICML 2025
Correlation Clustering Beyond the Pivot Algorithm
ICML 2025
Cost-Free Fairness in Online Correlation Clustering
ALT 2025
Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
AISTATS 2025
Sparse-pivot: Dynamic correlation clustering for node insertions
ICML 2025
Towards Better-than-2 Approximation for Constrained Correlation Clustering
ICML 2025
A 4-Approximation Algorithm for Min Max Correlation Clustering
AISTATS 2024
Dynamic Correlation Clustering in Sublinear Update Time
ICML 2024
Hierarchical Correlation Clustering and Tree Preserving Embedding
CVPR 2024
Optimal Algorithms for Learning Partitions with Faulty Oracles
NeurIPS 2024
Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models
ICML 2024
Query-Efficient Correlation Clustering with Noisy Oracle
NeurIPS 2024
SeMoLi: What Moves Together Belongs Together
CVPR 2024
ClusterFuG: Clustering Fully connected Graphs by Multicut
ICML 2023
FaLA: Fast Linear Adaptation for Replacing Backbone Models on Edge Devices
EMNLP 2023
Fast Combinatorial Algorithms for Min Max Correlation Clustering
ICML 2023
Improved Approximation for Fair Correlation Clustering
AISTATS 2023
Partial Optimality in Cubic Correlation Clustering
ICML 2023
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!
NeurIPS 2023
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost
NeurIPS 2023
Better Private Algorithms for Correlation Clustering
COLT 2022
Chromatic Correlation Clustering, Revisited
NeurIPS 2022
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds
ICML 2022