eprintid: 2764
rev_number: 8
eprint_status: archive
userid: 302
dir: disk0/00/00/27/64
datestamp: 2017-12-12 07:42:59
lastmod: 2017-12-12 07:42:59
status_changed: 2017-12-12 07:42:59
type: conference_item
metadata_visibility: show
creators_name: Pham, Canh V.
creators_name: Hoang, Xuan Huan
creators_id: maicanhki@gmail.com
creators_id: huanhx@vnu.edu.vn
corp_creators: Hoang M. Dinh
corp_creators: Hoan D. Nguyen
corp_creators: Huyen T. Dang
title: Limiting the Spread of Epidemics within Time Constraint on Online Social Networks
ispublished: pub
subjects: IT
divisions: fac_fit
abstract: In this paper, we investigate the problem of limiting the spread of epidemics on online social networks (OSNs) with the aim to seek a set nodes of size at most k to remove from the networks such that the number of saved nodes is maximal for cases where we already know the set of infected nodes on the networks. The problem is proved to be NP-hard and it is NP-hard to approximate the problem with ratio nexp(1−ϵ), for 0 < ϵ < 1. Besides, we also suggest two algorithms to solve the problem. Experimental results show that our proposed outperform baseline algorithms.
date: 2017-10-07
date_type: published
full_text_status: public
pres_type: paper
pagerange: 262-269
event_title: SoICT 2017
event_location: Nha Trang, Viet Nam
event_dates: 7-8
event_type: conference
refereed: TRUE
citation:   Pham, Canh V. and Hoang, Xuan Huan  (2017) Limiting the Spread of Epidemics within Time Constraint on Online Social Networks.  In: SoICT 2017, 7-8, Nha Trang, Viet Nam.     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2764/1/p262-canh-pham.pdf