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.
![[img]](https://eprints.uet.vnu.edu.vn/eprints/style/images/fileicons/application_pdf.png) |
PDF
Download (555kB) |
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Information Technology (IT) |
| Divisions: | Faculty of Information Technology (FIT) |
| Depositing User: | Hoàng Xuân Huấn |
| Date Deposited: | 12 Dec 2017 07:42 |
| Last Modified: | 12 Dec 2017 07:42 |
| URI: | http://eprints.uet.vnu.edu.vn/eprints/id/eprint/2764 |
Actions (login required)
 |
View Item |
