The limits of SDP relaxations for general-valued CSPs
It has been shown that for a general-valued constraint language Γ the following statements are equivalent: (1) any instance of VCSP(Γ) can be solved to optimality using a constant level of the Sherali-Adams LP hierarchy, (2) any instance of VCSP(Γ) can be solved to optimality using the third level o...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Journal article |
| Julkaistu: |
Association for Computing Machinary
2018
|