Valued Constraint Satisfaction Problems (VCSPs) can model many combinatorial problems. VCSPs that involve submodular valuation functions only is a particular class of VCSPs that have the advantage of being tractable. In this paper, we propose a problem decomposition strategy for binary VCSPs which consists in decomposing the problem to be solved into a set of submodular, and then tractable, subproblems. The decomposition strategy combines two problem solving techniques, namely domain partitioning and value permutation.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 email@example.com
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 firstname.lastname@example.org