Max Cut with Small-Dimensional SDP Solutions

Hsien-Chih Chang, Suprovat Ghoshal, Euiwoong Lee

For a feasible d-dimensional Max-Cut SDP solution strengthened by triangle inequalities, a randomized polynomial-time rounding algorithm attains expected cut value at least (α_GW+2^(−O(d))) times the SDP value.

Sources for this record

What was already known

Goemans–Williamson rounding achieves α_GW generally; Avidor and Zwick improved dimensions two and three, leaving higher fixed dimensions open.

AI involvement AI-centered

The authors credit Gemini and ChatGPT with the central geometric lemma and its dimension-dependent bound; they edited the proofs and integrated the rounding algorithm.

The source credits the models with the key geometric lemma and its optimal dimension-dependent bound; human authors supplied the paper, edits and algorithmic integration.

Importance Notable

Extends the improved approximation ratio to every fixed dimension for the strengthened SDP.

Limitations

The result requires triangle inequalities and does not settle the basic-SDP question. The human-edited paper gives proofs but does not document a completed theorem-specific check.

Technical verification Reported

Three proofs and a human-edited exposition are published, but no completed theorem-specific human or machine check is documented. Reported is the evidence default.

Human understanding Full

The human authors explain several routes to the central anti-concentration estimate and how it powers the Max-Cut rounding improvement.

Correction and publication history

2026-10-18 · publication

Extends the improved approximation ratio to every fixed dimension for the strengthened SDP.

Read this published revision