Pages that link to "Item:Q2444145"

The following pages link to Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145):

Displaying 2 items.

• A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
• Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)