Separation guarantee in Goemans Williamson algorithm
Feige and Schechtman, On the optimality of the random hyperplane rounding technique for max cut, constructed a graph on which all $r$ only give an $\alpha$-approximation, where $\alpha$ is the worst-case approximation ratio of the Goemans–Williamson algorithm.