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...
Prif Awduron: | Hirai, H, Iwamasa, Y, Murota, K, Zivny, S |
---|---|
Fformat: | Journal article |
Cyhoeddwyd: |
Association for Computing Machinery
2019
|
Eitemau Tebyg
-
Beyond JWP: A tractable class of binary VCSPs via M-convex intersection
gan: Hirai, H, et al.
Cyhoeddwyd: (2018) -
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
gan: Kolmogorov, V, et al.
Cyhoeddwyd: (2010) -
Discrete convexity in joint winner property
gan: Iwamasa, Y, et al.
Cyhoeddwyd: (2018) -
Beyond boolean surjective VCSPs
gan: Matl, G, et al.
Cyhoeddwyd: (2019) -
Tractable classes of binary CSPs defined by excluded topological minors
gan: Cohen, D, et al.
Cyhoeddwyd: (2015)