theoretical-computer-science / Approximation algorithms
For fixed $d$, can every $d$-dimensional feasible solution of the triangle-strengthened Max-Cut SDP be rounded in polynomial time with ratio strictly larger than $\alpha_{GW}$? A rounding achieving $\alpha_{GW} + 2^{-O(d)}$ answers yes.
Temporal state
No reconciled state yet.
Append-only history
For fixed $d$, can every $d$-dimensional feasible solution of the triangle-strengthened Max-Cut SDP be rounded in polynomial time with ratio strictly larger than $\alpha_{GW}$? A rounding achieving $\alpha_{GW} + 2^{-O(d)}$ answers yes.
Research memory
For fixed $d$, can every $d$-dimensional feasible solution of the triangle-strengthened Max-Cut SDP be rounded in polynomial time with ratio strictly larger than $\alpha_{GW}$? A rounding achieving $\alpha_{GW} + 2^{-O(d)}$ answers yes.
Evidence graph
No public relationships recorded yet.