Pages that link to "Item:Q2908876"
From MaRDI portal
The following pages link to Quasi-random PCP and hardness of 2-catalog segmentation (Q2908876):
Displaying 3 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)