Binarisation for valued constraint satisfaction problems
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary C...
| Main Authors: | , , , , , |
|---|---|
| פורמט: | Journal article |
| יצא לאור: |
Society for Industrial and Applied Mathematics
2017
|