Name
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10878-020-00560-w | Journal of Combinatorial Optimization |
Keywords | DocType | Volume |
DS decomposition, Set function, Supermodular, Active friending, Social network optimization | Journal | 40 |
Issue | ISSN | Citations |
1 | 1382-6905 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiang Li | 1 | 0 | 0.34 |
| H. George Du | 2 | 0 | 0.34 |
| Panos M. Pardalos | 3 | 141 | 19.60 |