The RPR2 rounding technique for semidefinite programs
From MaRDI portal
Publication:5483509
DOI10.1016/j.jalgor.2004.11.003zbMath1113.90116OpenAlexW2143738202MaRDI QIDQ5483509
Publication date: 14 August 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.11.003
Related Items (19)
Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix ⋮ An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation ⋮ An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding ⋮ On bisections of graphs without complete bipartite graphs ⋮ On judicious bisections of graphs ⋮ A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis ⋮ Graph partitioning: an updated survey ⋮ Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems ⋮ Bisections of graphs ⋮ Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ An improved kernel for max-bisection above tight lower bound ⋮ The MIN-cut and vertex separator problem ⋮ Approximation algorithms for MAX RES CUT with limited unbalanced constraints ⋮ An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance ⋮ A bounded-error quantum polynomial-time algorithm for two graph bisection problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
This page was built for publication: The RPR2 rounding technique for semidefinite programs
