Pages that link to "Item:Q3448840"
From MaRDI portal
The following pages link to Approximating CSPs Using LP Relaxation (Q3448840):
Displaying 8 items.
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Solving RCPSP/max by lazy clause generation (Q2434317) (← links)
- Approximate Constraint Satisfaction Requires Large LP Relaxations (Q3177811) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- From weak to strong linear programming gaps for all constraint satisfaction problems (Q4568111) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- CSP gaps and reductions in the lasserre hierarchy (Q5172724) (← links)