Discrete convexity in joint winner property
In this paper, we reveal a relation between joint winner property (JWP) in the field of valued constraint satisfaction problems (VCSPs) and M♮-convexity in the field of discrete convex analysis (DCA). We introduce the M♮-convex completion problem, and show that a function f satisfying the JWP is Z-f...
Main Authors: | Iwamasa, Y, Murota, K, Zivny, S |
---|---|
Format: | Journal article |
Published: |
Elsevier
2018
|
Similar Items
-
A tractable class of binary VCSPs via M-convex intersection
by: Hirai, H, et al.
Published: (2019) -
Beyond JWP: A tractable class of binary VCSPs via M-convex intersection
by: Hirai, H, et al.
Published: (2018) -
Discrete convex analysis: A tool for economics and game theory
by: Kazuo Murota
Published: (2016-12-01) -
Tractable triangles and cross−free convexity in discrete optimisation
by: Cooper, M, et al.
Published: (2012) -
Discrete convexity cones
by: Gh. Toader
Published: (1988-02-01)