The following pages link to Approximation Algorithms for CSPs (Q4993604):
Displaying 16 items.
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- A CSP search algorithm with responsibility sets and kernels (Q2454814) (← links)
- (Q2934606) (← links)
- Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
- Approximating Bounded Occurrence Ordering CSPs (Q3167393) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5091252) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- (Q5874535) (← links)
- Recent Advances in Constraints (Q5899109) (← links)
- Every 2-CSP allows nontrivial approximation (Q5901103) (← links)
- (Q6058189) (← links)
- On the complexity of CSP-based ideal membership problems (Q6083496) (← links)
- On approximability of satisfiable <i>k</i> -CSPs: I (Q6083552) (← links)
- (Q6176154) (← links)