Pages that link to "Item:Q4650629"

The following pages link to Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629):

Displaying 7 items.

• 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)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• Robust solutions of uncertain complex-valued quadratically constrained programs (Q2519336) (← links)
• A continuation algorithm for max-cut problem (Q2644353) (← links)
• Quasi-random PCP and hardness of 2-catalog segmentation (Q2908876) (← links)