Pages that link to "Item:Q2444145"
From MaRDI portal
The following pages link to Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145):
Displaying 5 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)
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849) (← links)
- Quasi-random PCP and hardness of 2-catalog segmentation (Q2908876) (← links)
- Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629) (← links)