Online Correlation Clustering with Metric Weights
This work gives a deterministic online algorithm that maintains a clustering whose total weighted disagreement cost is within an $O(1)$ factor of the offline optimum, against adversarial arrival order, and shows that metric consistency on the edge weights separates tractable from intractable online instances.