Using a min-cut generalisation to go beyond Boolean surjective VCSPs
In this work, we first study a natural generalisation of the Min-Cut problem, where a graph is augmented by a superadditive set function defined on its vertex subsets. The goal is to select a vertex subset such that the weight of the induced cut plus the set function value are minimised. In addition...
Main Authors: | , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Springer
2020
|