A tractable class of binary VCSPs via M-convex intersection
<p>A binary VCSP is a general framework for the minimization problem of a function represented as the sum of unary and binary cost functions. An important line of VCSP research is to investigate what functions can be solved in polynomial time. Cooper and Živný classified the tractability of bi...
| Huvudupphovsmän: | , , , |
|---|---|
| Materialtyp: | Journal article |
| Publicerad: |
Association for Computing Machinery
2019
|