%0 Journal Article
%@ 1382-6905
%A Pham, Canh V.
%A Thai, My T.
%A Duong, Hieu V.
%A Bui, Bao Q.
%A Hoang, Xuan Huan
%D 2018
%F SisLab:3435
%J Journal of Combinatorial Optimization
%N 4
%P 1202-1240
%T Maximizing misinformation restriction within time and budget constraints
%U https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3435/
%V 35
%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