<> "The repository administrator has not yet configured an RDF license."^^ . <> . . . "Maximizing misinformation restriction within time and budget constraints"^^ . "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"^^ . "2018-02" . . "35" . "4" . . "Journal of Combinatorial Optimization"^^ . . . "13826905" . . . . . . . . . . . . . . . . . . . "Xuan Huan"^^ . "Hoang"^^ . "Xuan Huan Hoang"^^ . . "My T."^^ . "Thai"^^ . "My T. Thai"^^ . . "Bao Q."^^ . "Bui"^^ . "Bao Q. Bui"^^ . . "Canh V."^^ . "Pham"^^ . "Canh V. Pham"^^ . . "Hieu V."^^ . "Duong"^^ . "Hieu V. Duong"^^ . . . . . "HTML Summary of #3435 \n\nMaximizing misinformation restriction within time and budget constraints\n\n" . "text/html" . . . "Scopus-indexed journals"@en . . . "ISI-indexed journals"@en . .