Chromatic Correlation Clustering

• Chromatic Correlation Clustering (CCC) is a generalization of correlation clustering where edge colors impose semantic constraints requiring clusters to be monochromatic.
• The method leverages LP relaxations with specialized rounding functions to tackle neutral edges, achieving approximation ratios as low as 2.15.
• CCC addresses multi-relational and fairness issues by ensuring each cluster adheres to a single dominant color, enhancing applications in bioinformatics and network analysis.

Chromatic Correlation Clustering (CCC) is a generalization of correlation clustering in which edges carry semantic colors and each output cluster must receive a single color label. In the now-standard edge-colored formulation introduced by Bonchi et al., the input is a complete graph, ordinary colors represent distinct similarity types, and a special label $\gamma$ plays the role of dissimilarity: an edge of color $c\in L$ is satisfied only when its endpoints are co-clustered in a cluster labeled $c$, while a $\gamma$-edge is satisfied only when its endpoints are separated. This formulation extends binary $+/-$ correlation clustering, but it also introduces a distinctly chromatic source of difficulty absent from the classical problem: edges of the “wrong” positive color become mismatches inside an otherwise coherent cluster (Lee et al., 28 May 2025, Shihab et al., 17 Apr 2026).

1. Formal model and objective

In the edge-colored model, a CCC instance consists of a complete graph on vertex set $V$, a finite set of ordinary colors $L$, and a coloring function

$\phi : \binom{V}{2} \to L \cup \{\gamma\},$

where $\gamma$ is the special “negative” or “dissimilar” label. A solution is a partition $\mathcal C$ of $c\in L$0 together with a color assignment $c\in L$1, so every cluster is monochromatic in the sense that it receives one cluster color (Lee et al., 28 May 2025).

The disagreement objective is the natural chromatic extension of classical correlation clustering. If $c\in L$2, the edge wants $c\in L$3 and $c\in L$4 to lie in the same cluster colored $c\in L$5; cost is paid if they are separated or if they are together in a cluster whose color is different from $c\in L$6. If $c\in L$7, the edge wants separation, and cost is paid when its endpoints lie in the same cluster. Equivalently, the cost of $c\in L$8 counts positive/color edges whose color-specific preference is violated, together with negative edges trapped inside a cluster (Shihab et al., 17 Apr 2026).

When $c\in L$9, CCC collapses to ordinary correlation clustering: the unique ordinary color becomes the classical positive label, $c$0 becomes the negative label, and the cluster color is irrelevant. This reduction is central both algorithmically and conceptually, because it lets one compare approximation ratios, LP relaxations, and integrality gaps between the chromatic and non-chromatic settings (Lee et al., 28 May 2025).

A second strand of literature studies color-constrained or fair correlation clustering using vertex colors and per-cluster balance constraints. That model is not identical to the edge-colored semantic model, but the fair-correlation-clustering literature explicitly uses “fair correlation clustering” and “chromatic correlation clustering” interchangeably when the constraints match. In that setting, colors are attached to vertices rather than edges, and the goal is to minimize disagreements while enforcing per-cluster color proportions or bounds (Ahmadi et al., 2020).

2. Standard LP relaxation and the role of neutral edges

The standard LP relaxation for CCC uses variables $c$1 and $c$2 for each vertex $c$3, pair $c$4, and color $c$5. Intuitively, $c$6 is the fractional assignment weight of vertex $c$7 to color $c$8, and $c$9 is the fractional agreement of pair $\gamma$0 under color $\gamma$1. The relaxation is

$\gamma$2

subject to edge-domination constraints $\gamma$3, per-color triangle inequalities $\gamma$4, and the chromatic normalization $\gamma$5 (Lee et al., 28 May 2025).

This LP is a faithful fractional encoding of the combinatorial objective. For a positive edge $\gamma$6, the contribution is $\gamma$7, which is $\gamma$8 when $\gamma$9 and $+/-$0 are together in a $+/-$1-cluster and $+/-$2 otherwise in an integral solution. For a negative edge $+/-$3, the contribution $+/-$4 is $+/-$5 exactly when the pair is together in some cluster and $+/-$6 when it is separated (Shihab et al., 17 Apr 2026).

The technical novelty of CCC appears when one fixes a candidate color $+/-$7 during rounding. Relative to that color, edges split into three classes: $+/-$8 with true color $+/-$9, $V$0 with true label $V$1, and $V$2 consisting of all other positive colors. These $V$3 edges are the neutral edges. They have no analogue in standard correlation clustering. A neutral edge already incurs cost $V$4 if its endpoints are placed together in a $V$5-cluster, because the cluster color disagrees with the edge color, yet in LP analysis it is charged by a more complicated lower bound than an ordinary negative edge. The literature identifies these neutral edges as the structural source of the extra hardness of CCC (Shihab et al., 17 Apr 2026).

This observation underlies the standard triple-based analysis. For a triple $V$6 under a fixed color $V$7, one compares expected rounding cost and local LP charge conditioned on each pivot choice. The resulting inequality has the same overall shape as in Chawla-style analyses for classical correlation clustering, but the neutral-edge term is stronger: when $V$8, the LP may pay only about $V$9 while the rounding can pay nearly $L$0. That mismatch drives the chromatic penalty (Lee et al., 28 May 2025).

3. LP-pivot algorithms and the classical approximation line

All known early approximation algorithms for the edge-colored version of CCC are built on the same high-level blueprint: solve the standard CCC LP, identify a “majority color” for each vertex, decompose the instance into color-specific subproblems, and apply a pivot-style LP rounding within each color class. Concretely, one defines

$L$1

places each uncertain vertex that has no such color into a singleton cluster, and then runs LP-Pivot on the induced graph $L$2, treating edges of true color $L$3 as positive, $L$4-edges as negative, and all other positive colors as neutral (Lee et al., 28 May 2025).

The historical progression of guarantees is explicit. Bonchi et al. introduced CCC and proposed heuristics but no approximation guarantee. Anava et al. gave a 4-approximation via LP rounding and another algorithm, “Reduce and Cluster,” with ratio 11. Klodt et al. showed that the original Pivot algorithm for correlation clustering gives a 3-approximation for CCC, improved the RC algorithm to a 5-approximation, and proposed the heuristic Greedy Expansion. Xiu et al. obtained a 2.5-approximation using an LP-based pivoting algorithm with $L$5. Fan–Lee–Lee then improved the ratio to $L$6 and proved that no algorithm in the same LP + pivot + triple-analysis framework can achieve a factor at most $L$7 (Lee et al., 28 May 2025).

The $L$8-approximation uses the Chawla et al. rounding functions for positive and negative edges,

$L$9

together with a specially designed neutral-edge function

$\phi : \binom{V}{2} \to L \cup \{\gamma\},$0

The resulting algorithm, denoted LP-CCC, achieves

$\phi : \binom{V}{2} \to L \cup \{\gamma\},$1

The lower bound $\phi : \binom{V}{2} \to L \cup \{\gamma\},$2 is a framework lower bound rather than a single explicit hard instance: it is derived by comparing incompatible constraints on $\phi : \binom{V}{2} \to L \cup \{\gamma\},$3 obtained from different triangle patterns (Lee et al., 28 May 2025).

4. Chromatic interference, global gap decomposition, and color coupling

A more structural account of why CCC is harder than classical correlation clustering is given by the 2026 analysis of cross-edge chromatic interference. Standard correlation clustering on complete graphs has LP integrality gap $\phi : \binom{V}{2} \to L \cup \{\gamma\},$4 and a $\phi : \binom{V}{2} \to L \cup \{\gamma\},$5-approximation under the classical LP-based line. For CCC, the analogous LP under color-independent rounding has a strict lower bound of $\phi : \binom{V}{2} \to L \cup \{\gamma\},$6, and the best known LP-rounding algorithm achieves $\phi : \binom{V}{2} \to L \cup \{\gamma\},$7. The explanation is that neutral edges create an irreducible mismatch penalty absent from standard correlation clustering (Shihab et al., 17 Apr 2026).

The central theorem is a Global Integrality Gap Decomposition Theorem for color-independent algorithms operating on the CCC-LP polytope: $\phi : \binom{V}{2} \to L \cup \{\gamma\},$8 where $\phi : \binom{V}{2} \to L \cup \{\gamma\},$9 is the global correlation-clustering LP gap on complete graphs and $\gamma$0 is a chromatic penalty depending on the number of colors. The analysis constructs a Chromatic Blowup Graph from a hard CC instance, embeds the original difficulty along same-color edges, and uses dense neutral edges between colors to realize the worst neutral triple constraints globally. The conclusion is that the extra hardness is not merely a local proof artifact (Shihab et al., 17 Apr 2026).

The penalty has a closed form. If colors are roughly balanced, the neutral-edge density under any fixed processing color is $\gamma$1, and the resulting staircase formula is

$\gamma$2

Thus

$\gamma$3

$\gamma$4	$\gamma$5	Predicted gap
$\gamma$6	$\gamma$7	$\gamma$8
$\gamma$9	$\mathcal C$0	$\mathcal C$1
$\mathcal C$2	$\mathcal C$3	$\mathcal C$4
$\mathcal C$5	$\mathcal C$6	$\mathcal C$7
$\mathcal C$8	$\mathcal C$9	$c\in L$00

Already at $c\in L$01, the lower bound $c\in L$02 separates two-color CCC from ordinary correlation clustering within the color-independent LP-rounding framework (Shihab et al., 17 Apr 2026).

The same work also proposes Color-Coupled Correlation Clustering (C4), which augments the standard LP with the valid global constraint

$c\in L$03

In affinity variables $c\in L$04, this is $c\in L$05, which forbids a pair from being simultaneously “strongly together” in many colors. Combined with correlated interval-packing rounding, this makes neutral edges behave like classical negative edges and yields

$c\in L$06

In that sense, C4 bypasses the $c\in L$07 lower bound for the uncoupled LP by changing both the formulation and the rounding scheme (Shihab et al., 17 Apr 2026).

5. Chromatic cluster LP and stronger relaxations

A separate algorithmic line replaces the standard edge-based LP with a chromatic cluster LP. Instead of using only pairwise variables, this formulation introduces variables $c\in L$08 for each nonempty subset $c\in L$09 and color $c\in L$10, where $c\in L$11 denotes the fractional count of a cluster equal to $c\in L$12 with color $c\in L$13. The coverage constraint is

$c\in L$14

and the objective charges, for each potential cluster $c\in L$15 of color $c\in L$16, positive edges crossing $c\in L$17, negative edges inside $c\in L$18, and inside-$c\in L$19 positive edges whose color is not $c\in L$20. This is the direct chromatic analogue of the classical cluster LP (Abbasi et al., 15 Oct 2025).

The cluster-LP viewpoint induces pairwise variables $c\in L$21 and vertex-color variables $c\in L$22, recovers the familiar objective

$c\in L$23

and strengthens the ordinary CCC relaxation. In the 1.64-approximation paper, the chromatic cluster LP implies the stronger metric constraint

$c\in L$24

which is stricter than the per-color triangle inequalities of the standard LP (Lee et al., 21 Jul 2025).

This stronger relaxation led to rapid progress. One paper showed that the chromatic cluster LP can be approximately solved in polynomial time for fixed $c\in L$25 using preclustering, a bounded Sherali–Adams type LP, and sampling-based reconstruction, and then rounded by a simple cluster-based randomized algorithm to obtain a $c\in L$26-approximation on complete graphs (Abbasi et al., 15 Oct 2025). A subsequent paper sharpened the approach to a randomized $c\in L$27-approximation. Its rounding mixes two procedures: a cluster-based rounding that samples clusters from the $c\in L$28, and a color-wise greedy pivot-based rounding using the simple functions

$c\in L$29

The final mixed algorithm chooses cluster-based rounding with probability $c\in L$30, pivot-based rounding with probability $c\in L$31, and sets $c\in L$32. The analysis is again local and triangle-based, but it is performed on the stronger cluster-LP geometry rather than on the standard CCC-LP (Lee et al., 21 Jul 2025).

A key methodological point is that both cluster-LP papers rely on preclustering and bounded local structure. The $c\in L$33-approximation uses preclusters, admissible edges, and a bounded-rank Sherali–Adams relaxation together with Raghavendra–Tan rounding (Abbasi et al., 15 Oct 2025). The $c\in L$34-approximation uses atoms, admissible edges, a bounded sub-cluster LP, and cluster sampling to construct a near-optimal chromatic cluster LP solution before applying mixed rounding (Lee et al., 21 Jul 2025). These results show that the standard LP barrier is not intrinsic to CCC as an approximation problem; it is a limitation of a particular relaxation and rounding paradigm.

6. Fairness interpretations, applications, and open directions

CCC was designed for multi-relational data, where edges encode different semantic relations such as “friend,” “colleague,” or “family,” and each recovered cluster must commit to one dominant relation type. The literature explicitly mentions applications including link classification, entity resolution, and bioinformatics, and later empirical work evaluates algorithms on real multi-relational networks such as Amazon co-purchase and DBLP co-authorship (Lee et al., 28 May 2025, Shihab et al., 17 Apr 2026).

The fairness literature provides a related but distinct interpretation. In fair correlation clustering, vertices have colors corresponding to demographic groups, and each cluster must satisfy prescribed color-ratio or upper/lower-bound constraints. The problem remains min-disagreement correlation clustering, but fairness is enforced by requiring, for example, exact $c\in L$35 ratios or interval bounds $c\in L$36 inside every cluster. The known approximation guarantees include $c\in L$37 for the two-color exact-ratio case and $c\in L$38 for the two-color bounded-ratio case, with multicolor extensions of order $c\in L$39 and $c\in L$40. The same line also proves NP-hardness even for two colors and exact $c\in L$41 constraints on complete unweighted graphs (Ahmadi et al., 2020).

The 2026 CCC analysis links these strands by interpreting chromatic labels as protected groups and defining the chromatic penalty $c\in L$42 as a price of fairness. In experiments on fairness benchmarks including Adult, German Credit, and COMPAS, the unconstrained CC gap is reported around $c\in L$43–$c\in L$44, the fairness-constrained or chromatic CCC gap increases by approximately $c\in L$45–$c\in L$46, consistent with the predicted $c\in L$47, and C4 reduces the fair CCC gap back near the unconstrained level, around $c\in L$48 (Shihab et al., 17 Apr 2026). This suggests that the approximation cost of fairness-like chromatic constraints depends strongly on whether colors are rounded independently or coupled globally.

Several open directions recur across the recent literature. One is whether CCC can inherit still better guarantees from the strongest correlation-clustering relaxations, including stronger LP or Sherali–Adams hierarchies. Another is the extension beyond complete graphs and unweighted instances. Further questions concern other color-coupling constraints, partial or noisy color information, weighted or pseudometric variants, and whether cluster-LP techniques can transfer to other constrained clustering problems such as $c\in L$49-center or $c\in L$50-means with protected attributes (Shihab et al., 17 Apr 2026, Abbasi et al., 15 Oct 2025, Lee et al., 21 Jul 2025). Together, these works establish CCC as a technically rich meeting point of multi-relational clustering, LP relaxation design, approximation theory, and fairness-aware unsupervised learning.