The following pages link to (Q5497122):
Displaying 5 items.
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- Automata, Languages and Programming (Q5716842) (← links)