The following pages link to (Q4252398):
Displaying 3 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145) (← links)
