We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Skew bisubmodularity and valued CSPs.

Huber, A. and Krokhin, A. and Powell, R. (2014) 'Skew bisubmodularity and valued CSPs.', SIAM journal on computing., 43 (3). pp. 1064-1084.


An instance of the (finite-)valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of values, and a sum of (rational-valued) functions, with each function depending on a subset of the variables. The goal is to find an assignment of values to the variables that minimizes the sum. We study (assuming that ${PTIME}\neq{NP}$) how the complexity of this very general problem depends on the functions allowed in the instances. The case when the variables can take only two values was classified by Cohen et al.: essentially, submodular functions give rise to the only tractable case, and any non--submodular function can be used to express, in a certain specific sense, the NP-hard Max Cut problem. We investigate the case when the variables can take three values. We identify a new infinite family of conditions that includes bisubmodularity as a special case and which can collectively be called skew bisubmodularity. By a recent result of Thapper and Živný, this condition implies that the corresponding VCSP can be solved by linear programming. We prove that submodularity, with respect to a total order, and skew bisubmodularity give rise to the only tractable cases, and, in all other cases, again, Max Cut can be expressed. We also show that our characterization of tractable cases is tight; that is, none of the conditions can be omitted.

Item Type:Article
Full text:(VoR) Version of Record
Download PDF
Publisher Web site:
Publisher statement:Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
Date accepted:21 January 2014
Date deposited:30 May 2014
Date of first online publication:08 May 2014
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar