Max Cut with Small-Dimensional SDP Solutions

TL;DR

This paper presents a polynomial-time rounding algorithm that improves Max-Cut approximation ratios for low-dimensional SDP solutions, surpassing the Goemans--Williamson bound.

Contribution

It introduces a new geometric anti-concentration lemma enabling better rounding for small-dimensional SDP solutions in Max-Cut.

Findings

Achieves approximation ratio of _{GW}+2^{-O(d)} for fixed dimension d

Provides a polynomial-time algorithm for low-dimensional SDP solutions

Introduces a novel geometric anti-concentration lemma

Abstract

We study the Max-Cut semidefinite programming (SDP) relaxation in the regime where a near-optimal solution admits a low-dimensional realization. While the Goemans--Williamson hyperplane rounding achieves the worst-case optimal approximation ratio $\alpha_{GW}\approx 0.87856$, it is natural to ask whether one can beat $\alpha_{GW}$ when the SDP solution lives in $\mathbb{R}^d$ for a small dimension $d$. We answer this in the affirmative for every fixed $d$: there is a polynomial-time rounding algorithm that, given a $d$-dimensional feasible solution to the standard Max-Cut SDP strengthened with triangle inequalities, produces a cut of expected value at least $(\alpha_{GW}+2^{-O(d)})$ times the SDP value. Our improvement is driven by a new geometric anti-concentration lemma for signs of low-dimensional Gaussian projections.