Pages that link to "Item:Q5483509"

The following pages link to The RPR2 rounding technique for semidefinite programs (Q5483509):

Displaying 17 items.

• An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
• On judicious bisections of graphs (Q402590) (← links)
• Bisections of graphs (Q461728) (← links)
• The MIN-cut and vertex separator problem (Q683339) (← links)
• A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
• Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
• Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
• An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
• An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
• An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
• Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
• An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849) (← links)
• Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145) (← links)
• (Q5158503) (← links)
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
• On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
• A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)