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