@article{SisLab3435,
          volume = {35},
          number = {4},
           month = {February},
          author = {Canh V. Pham and My T. Thai and Hieu V. Duong and Bao Q. Bui and Xuan Huan Hoang},
           title = {Maximizing misinformation restriction within time and budget constraints},
            year = {2018},
         journal = {Journal of Combinatorial Optimization},
             doi = {doi:10.1007/s10878-018-0252-3},
           pages = {1202--1240},
             url = {https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3435/},
        abstract = {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}
}