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...
Главные авторы: | 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, и др.
Опубликовано: (2018) -
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
по: Kolmogorov, V, и др.
Опубликовано: (2010) -
Discrete convexity in joint winner property
по: Iwamasa, Y, и др.
Опубликовано: (2018) -
Beyond boolean surjective VCSPs
по: Matl, G, и др.
Опубликовано: (2019) -
Tractable classes of binary CSPs defined by excluded topological minors
по: Cohen, D, и др.
Опубликовано: (2015)