eprintid: 3435
rev_number: 6
eprint_status: archive
userid: 4
dir: disk0/00/00/34/35
datestamp: 2019-02-18 03:42:27
lastmod: 2019-02-18 03:42:27
status_changed: 2019-02-18 03:42:27
type: article
metadata_visibility: show
creators_name: Pham, Canh V.
creators_name: Thai, My T.
creators_name: Duong, Hieu V.
creators_name: Bui, Bao Q.
creators_name: Hoang, Xuan Huan
creators_id: maicanhki@gmail.com
creators_id: huanhx@vnu.edu.vn
title: Maximizing misinformation restriction within time and budget constraints
ispublished: pub
subjects: Scopus
subjects: isi
divisions: fac_fit
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
date: 2018-02
date_type: published
official_url: http://doi.org/10.1007/s10878-018-0252-3
id_number: doi:10.1007/s10878-018-0252-3
full_text_status: none
publication: Journal of Combinatorial Optimization
volume: 35
number: 4
pagerange: 1202-1240
refereed: TRUE
issn: 1382-6905
citation:   Pham, Canh V. and Thai, My T. and Duong, Hieu V. and Bui, Bao Q. and Hoang, Xuan Huan  (2018) Maximizing misinformation restriction within time and budget constraints.  Journal of Combinatorial Optimization, 35  (4).   pp. 1202-1240.  ISSN 1382-6905