Pages that link to "Item:Q2826079"
From MaRDI portal
The following pages link to Linear programming, width-1 CSPs, and robust satisfaction (Q2826079):
Displaying 16 items.
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- On algebras with many symmetric operations (Q2821826) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- (Q4993594) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5089260) (← links)
- Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
- The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems (Q5138784) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
