6 citations · 15 across the 3 of their papers we have counts for
3 papers
cs.CC2010★ 5 cited
A dichotomy theorem for conservative general-valued CSPs
Vladimir Kolmogorov
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fixed set of cost functions over…
cs.CC2010★ 6 cited
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
Vladimir Kolmogorov, Stanislav Zivny
We study optimisation problems that can be formulated as valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fix…
cs.DM2010★ 4 cited
Submodularity on a tree: Unifying -convex and bisubmodular functions
Vladimir Kolmogorov
We introduce a new class of functions that can be minimized in polynomial time in the value oracle model. These are functions satisfying $f(x)+f(y)\ge f(x \sqcap y)+f(x \sqcup…