Pages that link to "Item:Q2908876"

The following pages link to Quasi-Random PCP and Hardness of 2-Catalog Segmentation (Q2908876):

Displaying 2 items.

• 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)