Minimum-cost CSPs admit a |D|-approximation for dual-discriminator languages, require near-unanimity polymorphisms for any constant-factor approximation, and have an exact approximability dichotomy over permutation-closed languages.
Polymorphisms, and How to Use Them
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
Minimum-cost CSPs admit a |D|-approximation for dual-discriminator languages, require near-unanimity polymorphisms for any constant-factor approximation, and have an exact approximability dichotomy over permutation-closed languages.