At a high-level, our rounding algorithm follows the general framework of [1]} and [2]}.
The algorithm proceeds in iterations, and in each iteration with the remaining instance \(G = (V, E)\) , the algorithm chooses a pivot \(p\)  uniformly at random from \(V\) , samples a random set \(S \ni p\) , creates \(S\)  as a new cluster, and proceeds with the remaining instance \(G \setminus S\) .
