Andreas Karrenbauer

Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering

Weighted correlation clustering is hard to solve and hard to approximate for general graphs. Its applications in network analysis and computer vision call for efficient algorithms. To this end, we make three contributions: We establish partial optimality conditions that can be checked efficiently, a…