%A Canh V. Pham
%A My T. Thai
%A Hieu V. Duong
%A Bao Q. Bui
%A Xuan Huan Hoang
%J Journal of Combinatorial Optimization
%T Maximizing misinformation restriction within time and budget constraints
%X 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
%N 4
%P 1202-1240
%V 35
%D 2018
%R doi:10.1007/s10878-018-0252-3
%L SisLab3435