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)