TY  - JOUR
ID  - SisLab3435
UR  - http://doi.org/10.1007/s10878-018-0252-3
IS  - 4
A1  - Pham, Canh V.
A1  - Thai, My T.
A1  - Duong, Hieu V.
A1  - Bui, Bao Q.
A1  - Hoang, Xuan Huan
Y1  - 2018/02//
N2  - Online social networks have become popular media worldwide. However,they also allow rapid dissemination of misinformation causing negative impacts tousers. With a source of misinformation, the longer the misinformation spreads, thegreater the number of affected users will be. Therefore, it is necessary to preventthe spread of misinformation in a specific time period. In this paper, we proposemaximizing misinformation restriction (MMR) problem with the purpose of finding aset of nodes whose removal from a social network maximizes the influence reductionfrom the source of misinformation within time and budget constraints. We demonstratethat theMMRproblem is NP-hard even in the case where the network is a rooted tree
JF  - Journal of Combinatorial Optimization
VL  - 35
SN  - 1382-6905
TI  - Maximizing misinformation restriction within time and budget constraints
SP  - 1202
AV  - none
EP  - 1240
ER  -