Streaming algorithms for Budgeted $k$-Submodular Maximization problem

Autor: Pham, Canh V., Vu, Quang C., Ha, Dung K. T., Nguyen, Tai T.

Stimulated by practical applications arising from viral marketing. This paper investigates a novel Budgeted $k$-Submodular Maximization problem defined as follows: Given a finite set $V$, a budget $B$ and a $k$-submodular function $f: (k+1)^V \mapsto

Externí odkaz: http://arxiv.org/abs/2109.08863

A new viral marketing strategy with the competition in the large-scale online social networks.

Autor: Pham, Canh V., Ha, Dung K., Ngo, Dung Q., Vu, Quang C., Hoang, Huan X.

Publikováno v: 2016 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation & Vision for the Future (RIVF); 2016, p1-6, 6p