A short proof for stronger version of DS decomposition in set function optimization
This brief article presents an alternative, short proof of the claim that every set function can be decomposed into the difference of two monotone increasing, strictly submodular functions. This article begin with the study of two similar theorems in DS decomposition. The shortened version of the proof provides a constructive algorithm which may, in the future, result in improved optimization algorithms.
scientific article; zbMATH DE number 7346743