TY  - CONF
ID  - SisLab2764
UR  - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2764/
A1  - Pham, Canh V.
A1  - Hoang, Xuan Huan
Y1  - 2017/10/07/
N2  - 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.
TI  - Limiting the Spread of Epidemics within Time Constraint on Online Social Networks
SP  - 262
M2  - Nha Trang, Viet Nam
AV  - public
EP  - 269
T2  - SoICT 2017
ER  -