Pages that link to "Item:Q3002802"
From MaRDI portal
The following pages link to SDP gaps and UGC-hardness for max-cut-gain (Q3002802):
Displaying 8 items.
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- Grothendieck-type inequalities in combinatorial optimization (Q2892967) (← links)
- On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension (Q5126773) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms (Q5885598) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- Approximating sparse quadratic programs (Q6180751) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
