The following pages link to Approximation of non-boolean 2CSP (Q4575701):
Displaying 5 items.
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- (Q5077145) (← links)
- Every 2-CSP allows nontrivial approximation (Q5901103) (← links)
