<> "The repository administrator has not yet configured an RDF license."^^ . <> . . . "Limiting the Spread of Epidemics within Time Constraint on Online Social Networks"^^ . "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."^^ . "2017-10-07" . . . . . . . . . . . "Xuan Huan"^^ . "Hoang"^^ . "Xuan Huan Hoang"^^ . . "Canh V."^^ . "Pham"^^ . "Canh V. Pham"^^ . . "Hoang M. Dinh"^^ . . . "Hoan D. Nguyen"^^ . . . "Huyen T. Dang"^^ . . . . . "SoICT 2017"^^ . . . . . "Nha Trang, Viet Nam"^^ . . . . . . "Limiting the Spread of Epidemics within Time Constraint on Online Social Networks (PDF)"^^ . . . "p262-canh-pham.pdf"^^ . . "HTML Summary of #2764 \n\nLimiting the Spread of Epidemics within Time Constraint on Online Social Networks\n\n" . "text/html" . . . "Information Technology (IT)"@en . .