Easier famility of graphs for MAXCUT [closed]

I would like to know if there are particular family of graphs for which the Goemans-Williamson MAXCUT Approximation Algorithm renders higher than 0.878 approximation ratio. TIA

• My guess is that OP meant to say "better" instead of "lower". Feb 18 at 18:15
• @ChandraChekuri In that case, those would be an easy family for the algorithm, not the hardest, right? Feb 18 at 19:01
• I think the OP means something like, "Is there an interesting family of graphs $\mathcal{F}$ on which MAX-CUT is known to be NP-hard and such that Goemans-Williamson restricted to graphs in $\mathcal{F}$ achieves an approximation factor of, say, $0.91$? This seems like a good question, although, as Emil notes, it's inconsistent with the title. Feb 18 at 19:53
• I don’t think this guessing game is going to get anywhere. The OP needs to make the question clear. Feb 18 at 21:01
• Somewhat related: doi.org/10.1016/S0196-6774(02)00005-6 Feb 23 at 20:53