Correlation clustering problem:
Given an undirected graph and two non negative weights for each edge .
The problem is to find a clustering that maximizes
Using k random hyperplanes ,then we get 2^k clusters.
Write the expected value of the clustering produced when using a general value of k and compare it to the value of the Semidefinite program relaxation (Use a plotting program to compute a bound on the approximation factor.)
