Paper Title

A variation of DS decomposition in set function optimization

Article Type

Research Article

Research Impact Tools

publications
0
supporting
0
mentioning
0
contrasting
0
Smart Citations
0
0
0
0
Citing PublicationsSupportingMentioningContrasting
View Citations

See how this article has been cited at scite.ai

scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.

Issue

Volume : 40 | Page No : 36–44

Published On

July, 2020

Downloads

Abstract

Any set function can be decomposed into the difference of two monotone nondecreasing submodular functions. This theorem plays an important role in the set function optimization theory. In this paper, we show a variation that any set function can be decomposed into the difference of two monotone nondecreasing supermodular functions. Meanwhile, we give an example in social network optimization and construct algorithmic solutions for the maximization problem of set functions with this variation of DS decomposition.

View more >>