Pages that link to "Item:Q3113788"
From MaRDI portal
The following pages link to A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem (Q3113788):
Displaying 16 items.
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- On planar valued CSPs (Q2396724) (← links)
- An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains (Q2674328) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5091252) (← links)
- (Q5136286) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- (Q5743434) (← links)
- PTAS for Sparse General-valued CSPs (Q6075749) (← links)