Min-max disagreements are an important generalization of the correlation clustering problem (CorCP). It can be defined as follows. Given a marked complete graph $G=(V, E)$ , each edge in is by positive label “+” or negative “−” based on similarity connected vertices. The goal to find xmlns:xlink...