Classes of submodular constraints expressible by graph cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the theory of combinatorial optimisation, that instances of VCSPs with submodular constraints can be minimised in polynomial...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
2008
|